Data_Structures_Lab_Codes/Quick_Sort.cpp at main · FarhanShuvon/Data_Structures_Lab_Codes · 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
#include<bits/stdc++.h>

using namespace std;

int A[100];

int partioning(int L, int H)
{
    int pivot = A[L];

    int i = L ,  j = H;

    while(i<j)
    {
        while(A[i]<=pivot)
        {
            i++;
        }

        while(A[j]> pivot)
        {
            j--;
        }

        if(i<j)
        {
            swap(A[i],A[j]);
        }

    }

    swap(A[L],A[j]);

    return j;
}

void quick_sort(int L , int H)
{
    if(L<H)
    {
        int j = partioning(L,H);

        quick_sort(L,j);
        quick_sort(L+1,H);
    }
}

int main()
{
    int n;
    cin>>n;


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

    A[n]=INT_MAX;

    quick_sort(0,n);

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

    cout<<endl;


    return 0;
}