DSAimplementations/quick_sort.cpp at main · kholiator/DSAimplementations · 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include<iostream>
using namespace std;

int partition(int a[],int si,int ei){
    int count=0;

    for(int i=si+1;i<=ei;i++){
        if(a[si]>a[i]){
            count++;
        }
    }
    int newindex=si+count;
    int temp=a[newindex];
    a[newindex]=a[si];
    a[si]=temp;

    int i=si;
    int j=ei;

    while(i<newindex && j>newindex){
        if(a[i]>a[newindex]){
            if(a[j]<a[newindex]){
            int temp2=a[i];
            a[i]=a[j];
            a[j]=temp2;
            i++;
            j--;

            }
            else{
                j--;
            }
        }
        else{
            i++;
        }
    }
    return newindex;

}
void quick_sort(int a[],int si,int ei){


if(si>=ei){
    return;
}
    int c=partition(a,si,ei);

    quick_sort(a,si,c-1);
    quick_sort(a,c+1,ei);


}

int main(){
    int n;
    cout<<"size of array"<<endl;
    cin>>n;

    int *a=new int [n];

    for(int i=0;i<n;i++){
        cin>>a[i];
    }

quick_sort(a,0,n-1);

for(int i=0;i<n;i++){
    cout<<a[i]<<" ";
}
cout<<endl;


delete[]a;
return 0;
}