Recursion/quickSort.cpp at main · insofcury/Recursion · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <stack>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <sstream>
#include <iomanip>
using namespace std;

int partitioning(int start, int end, vector<int>& arr){
    int i = start-1, j = start;
    int p = arr[end];

    for(; j < end ; j++){
        if(arr[j] <= p){
            i++;
            swap(arr[i], arr[j]);
        }
    }
    swap(arr[i+1], arr[end]);
    return i+1;
}

void divide(int start, int end, vector<int>& arr){
    if(start >= end)
        return;

    int p = partitioning(start, end, arr);

    divide(start, p-1, arr);
    divide(p+1, end, arr);
}

int32_t main()
{
    vector<int> arr = {2, 19, 1, 43, 23, 10, 8, 89, 41, 38};
    int i = 0, j = arr.size() - 1;
    divide(i, j, arr);

    for(int x : arr)
        cout<<x<<" ";
    cout<<endl;
}