Merge pull request #2 from msidrisi91/main

Added sorting algorithms

Author: kanishkaa24

sorting/bubble_sort.cpp

@@ -0,0 +1,28 @@
+// Bubble sort algorithm in cpp
+#include <iostream>
+using namespace std;
+
+int main() {
+    int n, i, j, temp;
+    cout << "Enter the number of elements: ";
+    cin >> n;
+    int a[n];
+    cout << "Enter the elements: ";
+    for (i = 0; i < n; i++) {
+        cin >> a[i];
+    }
+    for (i = 0; i < n; i++) {
+        for (j = 0; j < n - 1; j++) {
+            if (a[j] > a[j + 1]) {
+                temp = a[j];
+                a[j] = a[j + 1];
+                a[j + 1] = temp;
+            }
+        }
+    }
+    cout << "Sorted array: ";
+    for (i = 0; i < n; i++) {
+        cout << a[i] << " ";
+    }
+    return 0;
+} 

sorting/insertion_sort.cpp

@@ -0,0 +1,29 @@
+// Insertion Sort algorithm in cpp
+
+#include <iostream>
+using namespace std;
+
+int main() {
+    int n, i, j, key, temp;
+    cout << "Enter the number of elements: ";
+    cin >> n;
+    int a[n];
+    cout << "Enter the elements: ";
+    for (i = 0; i < n; i++) {
+        cin >> a[i];
+    }
+    for (i = 1; i < n; i++) {
+        key = a[i];
+        j = i - 1;
+        while (j >= 0 && a[j] > key) {
+            a[j + 1] = a[j];
+            j = j - 1;
+        }
+        a[j + 1] = key;
+    }
+    cout << "Sorted array is: ";
+    for (i = 0; i < n; i++) {
+        cout << a[i] << " ";
+    }
+    return 0;
+}

sorting/merge_sort.cpp

@@ -0,0 +1,45 @@
+// Merge Sort Algorithm in Cpp
+
+#include <iostream>
+using namespace std;
+
+int main() {
+    int n;
+    cin >> n;
+    int arr[n];
+    for (int i = 0; i < n; i++) {
+        cin >> arr[i];
+    }
+    int temp[n];
+    int mid = n / 2;
+    int i = 0;
+    int j = mid;
+    int k = 0;
+    while (i < mid && j < n) {
+        if (arr[i] < arr[j]) {
+            temp[k] = arr[i];
+            i++;
+        } else {
+            temp[k] = arr[j];
+            j++;
+        }
+        k++;
+    }
+    while (i < mid) {
+        temp[k] = arr[i];
+        i++;
+        k++;
+    }
+    while (j < n) {
+        temp[k] = arr[j];
+        j++;
+        k++;
+    }
+    for (int i = 0; i < n; i++) {
+        arr[i] = temp[i];
+    }
+    for (int i = 0; i < n; i++) {
+        cout << arr[i] << " ";
+    }
+    return 0;
+}

sorting/selection sort.cpp

@@ -0,0 +1,31 @@
+// Selection sort algorithm in cpp
+
+#include <iostream>
+using namespace std;
+
+int main () {
+    int n, i, j, min, temp;
+    cout << "Enter the number of elements: ";
+    cin >> n;
+    int a[n];
+    cout << "Enter the elements: ";
+    for (i = 0; i < n; i++) {
+        cin >> a[i];
+    }
+    for (i = 0; i < n; i++) {
+        min = i;
+        for (j = i + 1; j < n; j++) {
+            if (a[j] < a[min]) {
+                min = j;
+            }
+        }
+        temp = a[i];
+        a[i] = a[min];
+        a[min] = temp;
+    }
+    cout << "Sorted array: ";
+    for (i = 0; i < n; i++) {
+        cout << a[i] << " ";
+    }
+    return 0;
+}