forked from ShiChuanTaylors/Data-Structure-Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuickSort.c
More file actions
110 lines (93 loc) · 1.75 KB
/
QuickSort.c
File metadata and controls
110 lines (93 loc) · 1.75 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
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
/* Data Structure and Algorithm - Quick Sort
* Created by Ting Shi Chuan, Software Engineering Student
* Taylor's University
*/
#include <stdio.h>
#define MAX_SIZE 10
void printArray(int data[], int size);
void quickSort(int arr[], int n);
void quickSortHelp(int a[], int s, int e);
int partition2(int arr[], int s, int e);
int main()
{
int arr1[MAX_SIZE], arr2[MAX_SIZE];
//Initialize Arrays
int i;
for(i = 0; i < MAX_SIZE; i++)
{
arr1[i] = arr2[i] = rand() % 1000; //fill values between 0 and 999
}
printf("Arr1 before sorting:\n");
printArray(arr1, MAX_SIZE);
//timeBefore = time(NULL);
quickSort(arr1, MAX_SIZE);
//timeAfter = time(NULL);
//timeNeededInSeconds = timeAfter - timeBefore;
printf("Arr1 after sorting with quick sort:\n"); printArray(arr1, MAX_SIZE);
}
void printArray(int data[], int size)
{
int i;
for(i = 0; i < size; i++)
{
printf(" %d ", data[i]);
}
}
void quickSort(int arr[], int n)
{
quickSortHelp(arr, 0, n-1);
}
void quickSortHelp(int a[], int s, int e)
{
if(e > s)
{
int p = partition2(a, s, e);
quickSortHelp(a, s, p-1);
quickSortHelp(a, p+1, e);
}
}
/* In place partitioning */
int partition2(int arr[], int s, int e)
{
int p = arr[s];
int l = s+1, r = e;
int temp;
while(l < r)
{
while(arr[l] <= p)
{
l++;
}
while(arr[r] > p)
{
r--;
}
temp = arr[l];
arr[l] = arr[r];
arr[r] = temp;
r--;
l++;
}
arr[s] = arr[r];
arr[r] = p;
return r;
}
/*
/*Partition using temporary array //not recommended
int partition(int arr[], int n)
{
int p = arr[0];
int l = 0, r = n-1;
//temporary array
int* temp = (int*)malloc(n*sizeof(int));
int i;
for(i = 0; i<n; i++)
{
if(p>arr[i])
b[l++] = arr[i];
else
b[r--] = arr[i];
}
b[r] = p;
return r;
}*/