Sanaa (#69)

## Summary by Sourcery

New Features:
- Implement a bubble sort algorithm in C++.

C++/bubbleSort.cpp

@@ -1,3 +1,9 @@
+#include <iostream>
+using namespace std;
+void bubbleSort(int arr[], int size) {
+  for (int step = 0; step < size; ++step) {
+    for (int i = 0; i < size - step - 1; ++i) {
+
 #include <bits/stdc++.h>
 using namespace std;
 void bubbleSort(int arr[], int size) {

C++/insertionsort.cpp

@@ -0,0 +1,33 @@
+#include <iostream>  
+using namespace std;  
+
+void insertionSort(int arr[], int n) {  
+    for (int i = 1; i < n; i++) {  
+        int key = arr[i];  
+        int 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--;  
+        }  
+        arr[j + 1] = key;  
+    }  
+}  
+
+void printArray(int arr[], int n) {  
+    for (int i = 0; i < n; i++)  
+        cout << arr[i] << " ";  
+    cout << endl;  
+}  
+
+int main() {  
+    int arr[] = {12, 11, 13, 5, 6};  
+    int n = sizeof(arr)/sizeof(arr[0]);  
+
+    insertionSort(arr, n);  
+    printArray(arr, n);  
+
+    return 0;  
+}