-
Notifications
You must be signed in to change notification settings - Fork 0
/
quickSort.c
75 lines (60 loc) · 1.83 KB
/
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include <stdio.h>
#include <stdlib.h>
int *createArray(int n) {
int *array = malloc( n * sizeof(int) );
if(array) {
for(int i=0; i<n; i++)
{
scanf("%d", &array[i]);
//array[i] = rand()%1000;
}
}
return array;
}
void swap(int *x, int *y) // Call by reference changes the address location of the element directly in the array without creating the copy of that array.
{
int t;
t = *x; // t = value at address x
*x = *y; // At address x, the value of y is stored.
*y = t;
}
int partition(int *a, int low, int high){
int pivot = a[high];
int i = low-1; //this would be the potition of the smaller value
int j;
for(j = low; j<=high-1; j++){
if(a[j] < pivot){ // if the a[j] is less than pivot element then increment i and swap the position of values
i++;
swap(&a[i], &a[j]); // swap the elements of an array
}
}
swap(&a[i+1], &a[high]);
return i+1; //retun i+1 to quickSort
}
void quickSort(int *a, int low, int high){
if(low < high){
int part = partition(a, low, high);
quickSort(a, low, part-1); // call quicksort from lower index till 1 less than partion point
quickSort(a, part+1, high); //here the starting point is 1 after the partition point
}
}
void printArray(int *a, int n) {
for(int i=0; i<n; i++) {
printf( i?", %d":"%d", a[i]); //Ternery operator
}
printf(".\n");
}
int main(){
int n;
int *array;
printf("Enter the size of array elements:");
scanf("%d", &n);
printf("Enter the values in an array: \n");
array = createArray(n);
printf("The original elements of an array are:\n ");
printArray(array, n);
quickSort(array, 0, n-1);
printf("The sorted array using heap Sort is:\n ");
printArray(array, n);
return 0;
}