c-programs/randomized_quickSort.c at master · khushi-1410/c-programs · 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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
#include<time.h>

int arr[10000], n;
int partition(int arr[], int m, int p);
void interchange(int arr[], int i, int j);
void QuickSort(int arr[], int p, int q);
void show();

int main()

{

// int arr[100], n;

 int i;
 time_t start, end;
 time_t diff;

 clrscr();
 printf("\nEnter the number of elements: ");

 scanf("%d", &n);
 randomize();     //Generates random elements


// printf("\nEnter the elements: ");

 for(i=0; i<n; i++)

 {

//  scanf("%d", &a[i]);

 arr[i]=random(100);

 }

 printf("\nThe elements are ");

 for(i=0; i<n; i++)

 {

  printf("%d ", arr[i]);

 }
    start=time(NULL);
    printf("\n\nThe passes are:");
    QuickSort(arr, 0, n-1);

    end=time(NULL);

    diff=difftime(end, start);
    printf("\n\nThe sorted array is ");

    for(i=0; i<n; i++)

    printf("%d ", arr[i]);
    printf("\n\nTime taken is %ld seconds", diff);
    getch();
    return 0;

}
//-------FIND THE POSITION OF THE PARTITION-------

int partition(int arr[], int m, int p)

{
    int v=arr[m];
    int i=m;
    int j=p;

    do

    {

        do

        i++;

        while(arr[i]<v);

        do

        j--;

        while(arr[j]>v);

        if(i<j)

        interchange(arr, i, j);

    }while(i<=j);

    arr[m]=arr[j];

    arr[j]=v;

    return j;

}
//-------INTERCHANGE THE ELEMENTS-------

void interchange(int arr[], int i, int j)

{

 int p;

 p=arr[i];

 arr[i]=arr[j];

 arr[j]=p;

}
//-------QUICK SORT-------

void QuickSort(int arr[], int p, int q)

{

 int j, k, temp;

 if(p<q)    //If there are more than 1 element, divide p into 2 sub-problems

 {

  k=rand() % (q-p+1)+p;
  interchange(arr, k, p);
  j=partition(arr, p, q+1);  //j is the position of partioning element

  show();

  //Solve sub-problems

  QuickSort(arr, p, j-1);
  QuickSort(arr, j+1, q);
 }

}
void show()
{
    int j;
    printf("\n");
    for(j=0; j<n; j++)
    printf("   %d", arr[j]);
}