Competitive_Programming/quicksort_partition.c at main · harshgupta7374/Competitive_Programming · 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<stdio.h>
int main()
{
    int left[1000],right[1000],equal[1000],arr[1000],n,i,p;

    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }

    p = arr[0];
    equal[0] = p;
    int k=0,j=0,m=0;
    for(i=1;i<n;i++)
    {
        if(arr[i] < p)
        {
            left[j] = arr[i];
            j++;
        }

        if(arr[i] > p)
        {
            right[k] = arr[i];
            k++;
        }

        if(arr[i] == p)
        {
            equal[m] = arr[i];
            m++;
        }

    }

    int lenl = j;

    for(j=0 ;j<lenl ;j++)
    {
        printf("%d ",left[j]);
    }

    int lene = m;

    for(m=0 ;m<=lene ;m++)
    {
        printf("%d ",equal[m]);
    }


    int lenr = k;

    for(k=0 ;k<lenr ;k++)
    {
        printf("%d ",right[k]);
    }
}