Selection sort

Algorithms/Dynamic Programming/subset_sum.cpp

@@ -0,0 +1,37 @@
+#include<bits/stdc++.h> 
+
+bool isSubsetSum(int set[], int n, int sum) 
+{
+    bool subset[n+1][sum+1]; 
+
+    for (int i = 0; i <= n; i++) 
+      subset[i][0] = true; 
+
+    for (int i = 1; i <= sum; i++) 
+      subset[0][i] = false; 
+
+     for (int i = 1; i <= n; i++) 
+     { 
+       for (int j = 1; j <= sum; j++) 
+       { 
+         if(j<set[i-1]) 
+         subset[i][j] = subset[i-1][j]; 
+         if (j >= set[i-1]) 
+           subset[i][j] = subset[i-1][j] ||  
+                                 subset[i - 1][j-set[i-1]]; 
+       } 
+     }
+     return subset[n][sum]; 
+}
+
+int main() 
+{ 
+  int set[] = {13, 34, 44, 18, 9, 23};
+  int sum = 56; 
+  int n = sizeof(set)/sizeof(set[0]); 
+  if (isSubsetSum(set, n, sum) == true) 
+     cout<<"Found a subset with given sum"<<endl; 
+  else
+     cout<<"No subset with given sum"<<endl; 
+  return 0; 
+}

Algorithms/sorting/Selection_sort.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+
+void swap(int *xp, int *yp)  
+{  
+    int temp = *xp;  
+    *xp = *yp;  
+    *yp = temp;  
+}  
+
+void selectionSort(int arr[], int n)  
+{  
+    int i, j, min_idx;  
+
+    for (i = 0; i < n-1; i++)  
+    {    
+        min_idx = i;  
+        for (j = i+1; j < n; j++)  
+        if (arr[j] < arr[min_idx])  
+            min_idx = j;  
+
+        swap(&arr[min_idx], &arr[i]);  
+    }  
+}  
+
+void printArray(int arr[], int size)  
+{  
+    int i;  
+    for (i=0; i < size; i++)  
+        cout << arr[i] << " ";  
+    cout << endl;  
+}  
+
+int main()  
+{  
+    int arr[] = {66, 13, 17, 235, 98};  
+    int n = sizeof(arr)/sizeof(arr[0]);  
+    selectionSort(arr, n);  
+    cout << "Sorted array: \n";  
+    printArray(arr, n);  
+    return 0;  
+}