-
Notifications
You must be signed in to change notification settings - Fork 0
/
sorting.c
198 lines (179 loc) · 5.17 KB
/
sorting.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
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
#include <stdio.h>
int arr[50], originalValues[50], n , search;
void display(int ar[], char* type) {
printf("%s: {", type);
for (int i = 0; i < n; i++)
printf("\t%d", ar[i]);
printf("\t}\n");
}
void resetArray() {
for (int i = 0; i < n; i++)
arr[i] = originalValues[i];
}
void initArr(){
int temp;
printf("Enter The Number Of Elements: ");
scanf("%d", &n);
for (int i = 0; i < n; i++) {
printf("Enter The Element %d: ", i + 1);
scanf("%d", &originalValues[i]);
arr[i] = originalValues[i];
}
display(arr, "Original Array");
}
void bubbleSort(int arr[5]){
int i, j, swapped;
for (i = 0; i < n - 1; i++) {
swapped = 0;
for (j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
swapped = 1;
}
}
if (swapped == 0)
break;
}
display(arr, "Bubble Sort");
}
void selectionSort(int arr[5]){
int pos, min;
for(int i = 0; i < n-1; i++){
min = arr[i];
pos = i;
for(int j = i+1; j < n; j++){
if (arr[j] < min){
min = arr[j];
pos = j;
}
}
int temp = arr[i];
arr[i] = arr[pos];
arr[pos] = temp;
}
display(arr, "Selection Sort");
}
void insertionSort(int arr[5]){
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
display(arr, "Insertion Sort");
}
int partition(int arr[100], int low, int high) {
int pivot = arr[low];
int i = low, j = high;
while (i < j) {
while (pivot >= arr[i])
i++;
while (pivot < arr[j])
j--;
if (i < j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
arr[low] = arr[j];
arr[j] = pivot;
return j;
}
void quickSort(int arr[100], int low, int high) {
if (low < high) {
int pivot = partition(arr, low, high);
quickSort(arr, low, pivot - 1);
quickSort(arr, pivot + 1, high);
}
}
void merge(int arr[100], int low, int mid, int high) {
int i, j, k, a[100];
i = low, k = low, j = mid + 1;
while (i <= mid && j <= high) {
if (arr[i] < arr[j]) {
a[k] = arr[i];
i++;
} else if (arr[i] > arr[j]) {
a[k] = arr[j];
j++;
}
k++;
}
while (i <= mid) {
a[k] = arr[i];
i++, k++;
}
while (j <= high) {
a[k] = arr[j];
j++, k++;
}
for (int i = low; i <= high; i++)
arr[i] = a[i];
}
void mergeSort(int arr[100], int low, int high) {
if (low < high) {
int mid = (low + high) / 2;
mergeSort(arr, low, mid);
mergeSort(arr, mid + 1, high);
merge(arr, low, mid, high);
}
}
void heapify(int arr[100], int n, int i) {
int l = (2 * i) + 1;
int r = (2 * i) + 2;
int largest = i;
while (l < n && arr[l] > arr[largest])
largest = l;
while (r < n && arr[r] > arr[largest])
largest = r;
if (largest != i) {
int temp = arr[largest];
arr[largest] = arr[i];
arr[i] = temp;
heapify(arr, n, largest);
}
}
void heapSort(int arr[100], int n) {
for (int i = n / 2; i >= 0; i--)
heapify(arr, n, i);
for (int i = n - 1; i >= 0; i--) {
int temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
heapify(arr, i, 0);
}
}
void main() {
int menuFlag = 1, o, d, p;
initArr();
printf("\n\t\t ============= MENU =============");
printf("\n\t\t 1) Bubble Sort");
printf("\n\t\t 2) Insertion Sort");
printf("\n\t\t 3) Selection Sort");
printf("\n\t\t 4) Quick Sort");
printf("\n\t\t 5) Merge Sort");
printf("\n\t\t 6) Heap Sort");
printf("\n\t\t 7) Exit");
printf("\n\t\t ================================\n");
while (menuFlag != 0) {
printf("\nEnter Your Option: ");
scanf("%d", & o);
switch (o) {
case 1: bubbleSort(arr); resetArray(); display(arr , "Original Array"); break;
case 2: insertionSort(arr); resetArray(); display(arr , "Original Array"); break;
case 3: selectionSort(arr); resetArray(); display(arr , "Original Array"); break;
case 4: quickSort(arr, 0, n - 1); display(arr , "Quick Sort"); resetArray(); display(arr , "Original Array"); break;
case 5: mergeSort(arr, 0, n - 1); display(arr, "Merge Sort"); resetArray(); display(arr , "Original Array"); break;
case 6: heapSort(arr, n); display(arr, "Heap Sort"); resetArray(); display(arr , "Original Array"); break;
case 7: menuFlag = 0; printf("Closing...\n"); break;
default: printf("Invalid choice!\n");
}
}
}