Added Sorting Algo's

cpp/insertion_sort.cpp

@@ -0,0 +1,46 @@
+#include <iostream>
+using namespace std;
+
+// perform insertion sort on arr[]
+void insertionSort(int arr[], int n)
+{
+	// Start from second element (element at index 0 
+	// is already sorted)
+	for (int i = 1; i < n; i++) 
+	{
+		int value = arr[i];
+		int j = i;
+
+		// Find the index j within the sorted subset arr[0..i-1]
+		// where element arr[i] belongs
+		while (j > 0 && arr[j - 1] > value) 
+		{
+			arr[j] = arr[j - 1];
+			j--;
+		}
+		// Note that subarray arr[j..i-1] is shifted to
+		// the right by one position i.e. arr[j+1..i]
+
+		arr[j] = value;
+	}
+}
+
+// Function to print n elements of the array arr
+void printArray(int arr[], int n)
+{
+	for (int i = 0; i < n; i++)
+		cout << arr[i] << " ";
+}
+
+int main()
+{
+	int arr[] = { 3, 8, 5, 4, 1, 9, -2 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+
+	insertionSort(arr, n);
+
+	// print the sorted array
+	printArray(arr, n);
+
+	return 0;
+}

cpp/insertion_sort_recursive.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+using namespace std;
+
+// recursive function to perform insertion sort on subarray arr[i..n]
+void insertionSort(int arr[], int i, int n)
+{ 
+	int value = arr[i];
+	int j = i;
+	// Find index j within the sorted subset arr[0..i-1]
+	// where element arr[i] belongs
+	while (j > 0 && arr[j - 1] > value) 
+	{
+		arr[j] = arr[j - 1];
+		j--;
+	}
+	arr[j] = value;
+	// Note that subarray arr[j..i-1] is shifted to
+	// the right by one position i.e. arr[j+1..i]
+
+    if (i + 1 <= n)
+		insertionSort(arr, i + 1, n);
+}
+
+// Function to print n elements of the array arr
+void printArray(int arr[], int n)
+{
+	for (int i = 0; i < n; i++)
+		cout << arr[i] << " ";
+}
+
+int main()
+{
+	int arr[] = { 3, 8, 5, 4, 1, 9, -2 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+
+	// Start from second element (element at index 0 
+	// is already sorted)
+	insertionSort(arr, 1, n - 1);
+
+	// print the sorted array
+	printArray(arr, n);
+
+	return 0;
+}

cpp/selection_sort.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+using namespace std;
+
+// perform selection sort on arr[]
+void selectionSort(int arr[], int n)
+{
+	// run (n - 1) times
+	for (int i = 0; i < n - 1; i++) 
+	{
+		// find the minimum element in the unsorted subarray[i..n-1] 
+		// and swap it with arr[i]
+		int min = i;
+
+		for (int j = i + 1; j < n; j++)
+		{
+			// if arr[j] element is less, then it is the new minimum
+			if (arr[j] < arr[min])
+				min = j;	// update index of min element
+		}
+
+		// swap the minimum element in subarray[i..n-1] with arr[i]
+		swap(arr[min], arr[i]);
+	}
+}
+
+// Function to print n elements of the array arr
+void printArray(int arr[], int n)
+{
+	for (int i = 0; i < n; i++)
+		cout << arr[i] << " ";
+}
+
+// main function
+int main()
+{
+	int arr[] = { 3, 5, 8, 4, 1, 9, -2 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+
+	selectionSort(arr, n);
+	printArray(arr, n);
+
+	return 0;
+}

cpp/selection_sort_recursive.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+using namespace std;
+
+// recursive function to perform selection sort on subarray arr[i..n-1]
+void selectionSort(int arr[], int i, int n)
+{
+	// find the minimum element in the unsorted subarray[i..n-1]
+	// and swap it with arr[i]
+	int min = i;
+	for (int j = i + 1; j < n; j++)
+	{
+		// if arr[j] element is less, then it is the new minimum
+		if (arr[j] < arr[min])
+			min = j;	// update index of min element
+	}
+
+	// swap the minimum element in subarray[i..n-1] with arr[i]
+	swap(arr[min], arr[i]);
+
+	if (i + 1 < n)
+		selectionSort(arr, i + 1, n);
+}
+
+// Function to print n elements of the array arr
+void printArray(int arr[], int n)
+{
+	for (int i = 0; i < n; i++)
+		cout << arr[i] << " ";
+}
+
+// main function
+int main()
+{
+	int arr[] = { 3, 5, 8, 4, 1, 9, -2 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+
+	selectionSort(arr, 0, n);
+	printArray(arr, n);
+
+	return 0;
+}