-
Notifications
You must be signed in to change notification settings - Fork 0
/
quickSort.c
56 lines (45 loc) · 936 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
53
54
55
56
#include<stdio.h>
void quickSort(int[], int, int);
int partition(int[], int, int);
void swap(int*, int*);
main(){
int n, i;
printf("Enter the size of Array: ");
scanf("%d", &n);
int arr[n];
printf("\nEnter the elements: ");
for(i=0; i<n;i++){
scanf("%d", &arr[i]);
}
quickSort(arr, 0 , n-1);
printf("After Sorting:\n");
for(i=0;i<n;i++){
printf("%d ", arr[i]);
}
}
void quickSort(int arr[], int low, int high){
int pIndex;
if(low<high){
pIndex = partition(arr, low, high);
quickSort(arr, low, pIndex -1);
quickSort(arr, pIndex+1, high);
}
}
int partition(int arr[], int low, int high){
int pIndex = low;
int i;
for(i= low; i<high;i++){
if(arr[i] < arr[high]){
swap(&arr[i], &arr[pIndex]);
pIndex++;
}
}
swap(&arr[high], &arr[pIndex]);
return pIndex;
}
void swap(int *a, int *b){
int temp;
temp = *a;
*a = *b;
*b = temp;
}