Uploaded c++ file

dynamic-programming/WordBreakProblem.cpp

@@ -0,0 +1,63 @@
+// A recursive program to test whether a given 
+// string can be segmented into space separated 
+// words in dictionary 
+#include <iostream> 
+using namespace std; 
+
+/* A utility function to check whether a word is 
+present in dictionary or not. An array of strings 
+is used for dictionary. Using array of strings for 
+dictionary is definitely not a good idea. We have 
+used for simplicity of the program*/
+int dictionaryContains(string word) 
+{ 
+string dictionary[] = {"mobile","samsung","sam","sung", 
+"man","mango","icecream","and", 
+"go","i","like","ice","cream"}; 
+int size = sizeof(dictionary)/sizeof(dictionary[0]); 
+for (int i = 0; i < size; i++) 
+if (dictionary[i].compare(word) == 0) 
+return true; 
+return false; 
+} 
+
+// returns true if string can be segmented into space 
+// separated words, otherwise returns false 
+bool wordBreak(string str) 
+{ 
+int size = str.size(); 
+
+// Base case 
+if (size == 0) return true; 
+
+// Try all prefixes of lengths from 1 to size 
+for (int i=1; i<=size; i++) 
+{ 
+// The parameter for dictionaryContains is 
+// str.substr(0, i) which is prefix (of input 
+// string) of length 'i'. We first check whether 
+// current prefix is in dictionary. Then we 
+// recursively check for remaining string 
+// str.substr(i, size-i) which is suffix of 
+// length size-i 
+if (dictionaryContains( str.substr(0, i) ) && 
+wordBreak( str.substr(i, size-i) )) 
+return true; 
+} 
+
+// If we have tried all prefixes and 
+// none of them worked 
+return false; 
+} 
+
+// Driver program to test above functions 
+int main() 
+{ 
+wordBreak("ilikesamsung")? cout <<"Yes\n": cout << "No\n"; 
+wordBreak("iiiiiiii")? cout <<"Yes\n": cout << "No\n"; 
+wordBreak("")? cout <<"Yes\n": cout << "No\n"; 
+wordBreak("ilikelikeimangoiii")? cout <<"Yes\n": cout << "No\n"; 
+wordBreak("samsungandmango")? cout <<"Yes\n": cout << "No\n"; 
+wordBreak("samsungandmangok")? cout <<"Yes\n": cout << "No\n"; 
+return 0; 
+} 

sorting/Insertion_Sort.cpp

@@ -0,0 +1,47 @@
+// C++ program for insertion sort 
+#include <bits/stdc++.h> 
+using namespace std; 
+
+/* Function to sort an array using insertion sort*/
+void insertionSort(int arr[], int n) 
+{ 
+int i, key, j; 
+for (i = 1; i < n; i++) 
+{ 
+key = arr[i]; 
+j = i - 1; 
+
+/* Move elements of arr[0..i-1], that are 
+greater than key, to one position ahead 
+of their current position */
+while (j >= 0 && arr[j] > key) 
+{ 
+arr[j + 1] = arr[j]; 
+j = j - 1; 
+} 
+arr[j + 1] = key; 
+} 
+} 
+
+// A utility function to print an array of size n 
+void printArray(int arr[], int n) 
+{ 
+int i; 
+for (i = 0; i < n; i++) 
+cout << arr[i] << " "; 
+cout << endl; 
+} 
+
+/* Driver code */
+int main() 
+{ 
+int arr[] = { 12, 11, 13, 5, 6 }; 
+int n = sizeof(arr) / sizeof(arr[0]); 
+
+insertionSort(arr, n); 
+printArray(arr, n); 
+
+return 0; 
+} 
+
+// This is code is contributed by rathbhupendra