Day33 (#229)

* Add @imkaka as a contributor

* day4

* Insertion Sort

Author: imkaka

day33/C++/insertionSort

@@ -0,0 +1,44 @@
+/*
+* @author : imkaka
+* @date : 4/2/2019
+*/
+
+#include<iostream>
+
+using namespace std;
+
+void insertionSort(int arr[], int size){
+    int key , j;
+    for(int i = 1; i < size; ++i){
+
+        key = arr[i];
+        j = i-1;
+
+       while (j >= 0 && arr[j] > key)
+       {
+           arr[j+1] = arr[j];
+           j = j-1;
+       }
+       arr[j+1] = key;
+   }
+}
+
+void print(int* arr, int size){
+    for(int i = 0; i < size; ++i)
+        cout << arr[i] << " ";
+}
+int main(){
+
+    int arr[] = {10, 12, 0, 36, -4, 2, 3, -36, 20};
+    int size = sizeof(arr) / sizeof(arr[0]);
+
+    cout << "Before Sorting: " << endl;
+    print(arr,size);
+    cout << endl;
+
+    insertionSort(arr, size);
+
+    cout << "After Sorting: " << endl;
+    print(arr,size);
+    return 0;
+}

day33/C++/insertionSort.cpp

@@ -35,6 +35,55 @@ function insertionSort(arr){
 console.log ( insertionSort ([1, 5, 2, 7, 3, 4, 8, 9, 6]));
 ```
 
+### [C++ Solution](./C++/insertionSort.cpp)
+
+```cpp
+/*
+* @author : imkaka
+* @date : 4/2/2019
+*/
+
+#include<iostream>
+
+using namespace std;
+
+void insertionSort(int arr[], int size){
+    int key , j;
+    for(int i = 1; i < size; ++i){
+
+        key = arr[i];
+        j = i-1;
+
+       while (j >= 0 && arr[j] > key)
+       {
+           arr[j+1] = arr[j];
+           j = j-1;
+       }
+       arr[j+1] = key;
+   }
+}
+
+void print(int* arr, int size){
+    for(int i = 0; i < size; ++i)
+        cout << arr[i] << " ";
+}
+int main(){
+
+    int arr[] = {10, 12, 0, 36, -4, 2, 3, -36, 20};
+    int size = sizeof(arr) / sizeof(arr[0]);
+
+    cout << "Before Sorting: " << endl;
+    print(arr,size);
+    cout << endl;
+
+    insertionSort(arr, size);
+
+    cout << "After Sorting: " << endl;
+    print(arr,size);
+    return 0;
+}
+```
+
 ## Java Implementation
 
 ### [Solution](./Java/insertionSort.java)
@@ -70,4 +119,4 @@ public class insertionSort {
         sort(a);
     }
 }
-```
+```