-
Notifications
You must be signed in to change notification settings - Fork 0
/
quicksort.c
52 lines (51 loc) · 953 Bytes
/
quicksort.c
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
#include <stdio.h>
int partition(int arr[], int l, int h)
{
int pivot = arr[l];
int i = l;
int j = h;
int t;
while (i < j)
{
while (arr[i] <= pivot)
i++;
while (arr[j] > pivot)
j--;
if (i < j)
{
t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
if (j <= i)
{
t = arr[l];
arr[l] = arr[j];
arr[j] = t;
}
return j;
}
void quicksort(int arr[], int l, int h)
{
if (l < h)
{
int pivot = partition(arr, l, h);
quicksort(arr, l, pivot - 1);
quicksort(arr, pivot + 1, h);
}
}
int main()
{
int arr[6];
printf("enter array elements \n");
for (int i = 0; i < 6; i++)
{
scanf("%d", &arr[i]);
}
quicksort(arr, 0, 5);
printf("The sorted array is :-\n");
for (int i = 0; i < 6; i++)
printf("%d ", arr[i]);
return 0;
}