-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquick sort.c
More file actions
58 lines (47 loc) · 1.27 KB
/
quick sort.c
File metadata and controls
58 lines (47 loc) · 1.27 KB
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int partition(int arr[], int st, int ed);
void quicksort(int arr[], int st, int ed);
int main(){
int arr [] = {4, 6, 2, 9, 1, 8, 3, 7, 5};
int n = sizeof(arr) / sizeof(arr[0]);
int st = 0;
int ed = n - 1;
printf("Original Array : ");
for (int i = 0; i <= ed; i ++){
printf("%d ", arr[i]);
}
quicksort(arr, st, ed);
printf("\n--------------\n");
printf("Sorted Array : ");
for (int i = 0; i <= ed; i ++){
printf("%d ", arr[i]);
}
printf("\n--------------\n");
}
int partition(int arr[], int st, int ed){
int pivot = arr[st];
int count = 0;
int temp;
for (int i = st + 1; i <= ed; i ++){
if (pivot >= arr[i]){
count += 1;
temp = arr[i];
arr[i] = arr[st + count];
arr[st + count] = temp;
}
}
temp = arr[st + count];
arr[st + count] = arr[st];
arr[st] = temp;
return st + count;
}
void quicksort(int arr[], int st, int ed){
if (ed >= st){
int pivot_pos;
pivot_pos = partition(arr, st, ed);
quicksort(arr, st, pivot_pos - 1);
quicksort(arr, pivot_pos + 1, ed);
}
}