Merge.cpp

C++/Heap.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+  using namespace std;
+
+  void heapify(int arr[], int n, int i) {
+    int max = i; 
+    int leftChild = 2 * i + 1;
+    int rightChild = 2 * i + 2;
+
+
+    if (leftChild < n && arr[leftChild] > arr[max])
+      max = leftChild;
+
+
+    if (rightChild < n && arr[rightChild] > arr[max])
+      max = rightChild;
+
+
+    if (max != i) {
+      swap(arr[i], arr[max]);
+      heapify(arr, n, max); 
+    }
+  }
+
+
+
+  void heapSort(int arr[], int n) {
+
+    for (int i = n / 2 - 1; i >= 0; i--)
+      heapify(arr, n, i);
+
+
+    for (int i = n - 1; i >= 0; i--) {
+      swap(arr[0], arr[i]); 
+
+      heapify(arr, i, 0); 
+    }
+  }
+
+
+  void display(int arr[], int n) {
+    for (int i = 0; i < n; ++i)
+      cout << arr[i] << " ";
+    cout << "\n";
+  }
+
+
+  int main() {
+    int arr[] = {11, 34, 9, 5, 16, 10};
+    int n = sizeof(arr) / sizeof(arr[0]);
+    cout << "Original array:\n";
+    display(arr, n);
+    heapSort(arr, n);
+
+    cout << "Sorted array:\n";
+    display(arr, n);
+  }
+

C++/merge.cpp

@@ -0,0 +1,74 @@
+#include <iostream>
+using namespace std;
+
+void merge(int arr[], int start, int mid, int end) {
+
+  int len1 = mid - start + 1;
+  int len2 = end - mid;
+
+  int leftArr[len1], rightArr[len2];
+
+  for (int i = 0; i < len1; i++)
+    leftArr[i] = arr[start + i];
+  for (int j = 0; j < len2; j++)
+    rightArr[j] = arr[mid + 1 + j];
+
+  int i, j, k;
+  i = 0;
+  j = 0;
+  k = start;
+
+  while (i < len1 && j < len2) {
+    if (leftArr[i] <= rightArr[j]) {
+      arr[k] = leftArr[i];
+      i++;
+    } else {
+      arr[k] = rightArr[j];
+      j++;
+    }
+    k++;
+  }
+
+  while (i < len1) {
+    arr[k] = leftArr[i];
+    i++;
+    k++;
+  }
+
+  while (j < len2) {
+    arr[k] = rightArr[j];
+    j++;
+    k++;
+  }
+}
+
+void mergeSort(int arr[], int start, int end) {
+  if (start < end) {
+    int mid = start + (end - start) / 2;
+
+    mergeSort(arr, start, mid);
+    mergeSort(arr, mid + 1, end);
+
+    merge(arr, start, mid, end);
+  }
+}
+
+void display(int arr[], int size) {
+  for (int i = 0; i < size; i++)
+    cout << arr[i] << " ";
+  cout << endl;
+}
+
+int main() {
+  int arr[] = {6, 5, 12, 10, 9, 1};
+  int size = sizeof(arr) / sizeof(arr[0]);
+
+  cout << "Original array \n";
+  display(arr, size);  
+
+  mergeSort(arr, 0, size - 1);
+
+  cout << "Sorted array \n";
+  display(arr, size);
+  return 0;
+}

C++/quicksort.cpp

@@ -0,0 +1,62 @@
+#include <bits/stdc++.h> 
+
+using namespace std;  
+
+void swap(int* ele1, int* ele2) 
+{  
+    int t = *ele1;  
+    *ele1 = *ele2;  
+    *ele2 = t;  
+}  
+
+
+int partition (int a[], int beg, int end) 
+{  
+    int pivot = a[end]; 
+    int i = (beg - 1); 
+
+    for (int j = beg; j <= end - 1; j++)  
+    {  
+
+        if (a[j] < pivot)  
+        {  
+            i++; 
+            swap(&a[i], &a[j]);  
+        }  
+    }  
+    swap(&a[i + 1], &a[end]);  
+    return (i + 1);  
+}  
+
+
+void quickSort(int a[], int beg, int end) 
+{  
+    if (beg < end)  
+    {  
+
+        int pIndex = partition(a, beg, end);  
+
+        quickSort(a, beg, pIndex - 1);  
+        quickSort(a, pIndex + 1, end);  
+    }  
+}  
+
+void display(int a[], int n)  
+{  
+
+    for (int i = 0; i < n; i++)  
+        cout << a[i] << " ";  
+    cout << endl;  
+}  
+
+int main()  
+{  
+    int a[] = {10, 7, 8, 9, 1, 5};  
+    int n = sizeof(a) / sizeof(a[0]);
+    cout << "Elements of array before sorting: \n";  
+    display(a, n);
+    quickSort(a, 0, n - 1);  
+    cout << "Elements of array after sorting: \n";  
+    display(a, n);  
+    return 0;  
+}  

Heap.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+  using namespace std;
+
+  void heapify(int arr[], int n, int i) {
+    int max = i; 
+    int leftChild = 2 * i + 1;
+    int rightChild = 2 * i + 2;
+
+
+    if (leftChild < n && arr[leftChild] > arr[max])
+      max = leftChild;
+
+
+    if (rightChild < n && arr[rightChild] > arr[max])
+      max = rightChild;
+
+
+    if (max != i) {
+      swap(arr[i], arr[max]);
+      heapify(arr, n, max); 
+    }
+  }
+
+
+
+  void heapSort(int arr[], int n) {
+
+    for (int i = n / 2 - 1; i >= 0; i--)
+      heapify(arr, n, i);
+
+
+    for (int i = n - 1; i >= 0; i--) {
+      swap(arr[0], arr[i]); 
+
+      heapify(arr, i, 0); 
+    }
+  }
+
+
+  void display(int arr[], int n) {
+    for (int i = 0; i < n; ++i)
+      cout << arr[i] << " ";
+    cout << "\n";
+  }
+
+
+  int main() {
+    int arr[] = {11, 34, 9, 5, 16, 10};
+    int n = sizeof(arr) / sizeof(arr[0]);
+    cout << "Original array:\n";
+    display(arr, n);
+    heapSort(arr, n);
+
+    cout << "Sorted array:\n";
+    display(arr, n);
+  }
+