Quick Sort (#233)

* Add @imkaka as a contributor

* day4

* Merge Sort

Author: imkaka

day35/C++/quickSort.cpp

@@ -0,0 +1,57 @@
+/*
+* @author : imkaka
+* @date   : 6/2/2019
+*/
+
+#include<iostream>
+
+using namespace std;
+
+void swap(int& a, int& b){
+    int temp = a;
+    a = b;
+    b = temp;
+}
+
+void quickSort(int arr[], int left, int right){
+
+    if(right - left <= 1)
+        return;
+
+    //Pivot arr[left]
+    int yellow = left +1;
+
+    for(int green = left+1; green < right; ++green){
+        if(arr[green] < arr[left]){
+            swap(arr[yellow], arr[green]);
+            yellow++;
+        }
+    }
+
+    //Move Pivot to original place
+    swap(arr[left], arr[yellow-1]);
+
+    quickSort(arr, left, yellow-1);
+    quickSort(arr, yellow, right);
+}
+
+void print(int arr[],int size){
+    for(int i = 0; i < size; ++i){
+        cout << arr[i] << " ";
+    }
+    cout << endl;
+}
+
+int main(){
+
+    int arr[] = {10, 25, 0, 23, 36, -1, 3, 1, 6};
+    int size = sizeof(arr)/sizeof(arr[0]);
+
+    cout << "Before Sorting: ";
+    print(arr, size);
+
+    quickSort(arr, 0, size);
+
+    cout << "After Sorting: ";
+    print(arr, size);
+}

day35/Python/quick_sort.py

@@ -0,0 +1,37 @@
+"""
+@author : imkaka
+@date   : 5/2/2019
+"""
+
+import sys
+
+
+def QuickSort(A, l, r):  # sort A[l:r]
+    if r - l <= 1:
+        return()
+
+    #Pivot  = A[l]
+    yellow = l + 1
+
+    for green in range(l + 1, r):
+        if(A[green] <= A[l]):
+            (A[yellow], A[green]) = (A[green], A[yellow])
+            yellow += 1
+    # Move Pivot into place
+    (A[l], A[yellow - 1]) = (A[yellow - 1], A[l])
+
+    QuickSort(A, l, yellow - 1)
+    QuickSort(A, yellow, r)
+
+
+def main():
+    A = [20, 34, 1, 3, -2, 34, 65, 100, 0]
+    print('Before Sorting', A)
+    print(len(A))
+    QuickSort(A, 0, len(A))
+
+    print('After Sorting', A)
+
+
+if __name__ == '__main__':
+    main()

day35/README.md

@@ -44,3 +44,108 @@ output: [1, 2, 3, 4, 5, 6, 7, 8, 9]
 ```js
 to be added
 ```
+
+### [C++ Implementation](./C++/quickSort.cpp)
+
+```cpp
+/*
+* @author : imkaka
+* @date   : 6/2/2019
+*/
+
+#include<iostream>
+
+using namespace std;
+
+void swap(int& a, int& b){
+    int temp = a;
+    a = b;
+    b = temp;
+}
+
+void quickSort(int arr[], int left, int right){
+
+    if(right - left <= 1)
+        return;
+
+    //Pivot arr[left]
+    int yellow = left +1;
+
+    for(int green = left+1; green < right; ++green){
+        if(arr[green] < arr[left]){
+            swap(arr[yellow], arr[green]);
+            yellow++;
+        }
+    }
+
+    //Move Pivot to original place
+    swap(arr[left], arr[yellow-1]);
+
+    quickSort(arr, left, yellow-1);
+    quickSort(arr, yellow, right);
+}
+
+void print(int arr[],int size){
+    for(int i = 0; i < size; ++i){
+        cout << arr[i] << " ";
+    }
+    cout << endl;
+}
+
+int main(){
+
+    int arr[] = {10, 25, 0, 23, 36, -1, 3, 1, 6};
+    int size = sizeof(arr)/sizeof(arr[0]);
+
+    cout << "Before Sorting: ";
+    print(arr, size);
+
+    quickSort(arr, 0, size);
+
+    cout << "After Sorting: ";
+    print(arr, size);
+}
+```
+
+### [Python Implementation](./Python/quick_sort.py)
+
+```py
+"""
+@author : imkaka
+@date   : 5/2/2019
+"""
+
+import sys
+
+
+def QuickSort(A, l, r):  # sort A[l:r]
+    if r - l <= 1:
+        return()
+
+    #Pivot  = A[l]
+    yellow = l + 1
+
+    for green in range(l + 1, r):
+        if(A[green] <= A[l]):
+            (A[yellow], A[green]) = (A[green], A[yellow])
+            yellow += 1
+    # Move Pivot into place
+    (A[l], A[yellow - 1]) = (A[yellow - 1], A[l])
+
+    QuickSort(A, l, yellow - 1)
+    QuickSort(A, yellow, r)
+
+
+def main():
+    A = [20, 34, 1, 3, -2, 34, 65, 100, 0]
+    print('Before Sorting', A)
+    print(len(A))
+    QuickSort(A, 0, len(A))
+
+    print('After Sorting', A)
+
+
+if __name__ == '__main__':
+    main()
+```
+