Sorting-Algorithm-Analyzer/quick_sort.cpp at main · SameerJain/Sorting-Algorithm-Analyzer · GitHub

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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298

// QuickSort ===================================================================

int partitionHA(int arr[], int start, int end)
{ // Hoarse
  int pivot = arr[start];
  int i = start, j = end;
  while (i < j)
  {
    do
    {
      i++;
    } while (arr[i] < pivot);
    do
    {
      j--;
    } while (arr[j] > pivot);
    if (i < j)
      swap(arr[i], arr[j]);
  }
  swap(arr[start], arr[j]);
  return j;
}
void quickSortHA(int arr[], int start, int end)
{
  if (start < end)
  {
    int pivot = partitionHA(arr, start, end);
    quickSortHA(arr, start, pivot);
    quickSortHA(arr, pivot + 1, end);
  }
}
int partitionHB(int arr[], int start, int end)
{
  int pivot = arr[start];
  int i = start, j = end;
  while (i < j)
  {
    do
    {
      i++;
    } while (arr[i] > pivot);
    do
    {
      j--;
    } while (arr[j] < pivot);
    if (i < j)
      swap(arr[i], arr[j]);
  }
  swap(arr[start], arr[j]);
  return j;
}
void quickSortHB(int arr[], int start, int end)
{
  if (start < end)
  {
    int pivot = partitionHB(arr, start, end);
    quickSortHB(arr, start, pivot);
    quickSortHB(arr, pivot + 1, end);
  }
}

int partitionLA(int arr[], int start, int end) // Lamuto
{

  int pivot = arr[end]; // pivot position is at end
  int j = start - 1;    // index of smalllest element in array - 1 as j starts next to it

  for (int i = start; i <= end - 1; i++) // go thru array
  {
    if (arr[i] <= pivot) // if the element if smaller than swap
    {
      j++; // move i over first so you dont constantly swap in the same position
      swap(arr[j], arr[i]);
    }
  }
  swap(arr[j + 1], arr[end]); // move the pivot into the array from the space next to i
  return (j + 1);             // place of pivot in the array
}

void QuicksortLA(int arr[], int start, int end)
{
  if (start < end) // as long as the quicksort ran thru all elements in the array
  {
    int partIndex = partitionLA(arr, start, end); // sort array and get partition index
    QuicksortLA(arr, start, partIndex - 1);       // redo recursevely for each subarray
    QuicksortLA(arr, partIndex + 1, end);
  }
}

int partitionLB(int arr[], int start, int end)
{

  int pivot = arr[end]; // pivot position is at end
  int j = start - 1;    // index of smalllest element in array - 1 as j starts next to it

  for (int i = start; i <= end - 1; i++) // go thru array
  {
    if (arr[i] >= pivot) // if the element if greater than swap
    {
      j++; // move i over first so you dont constantly swap in the same position
      swap(arr[j], arr[i]);
    }
  }
  swap(arr[j + 1], arr[end]); // move the pivot into the array from the space next to i
  return (j + 1);             // place of pivot in the array
}

void QuicksortLB(int arr[], int start, int end)
{
  if (start < end) // as long as the quicksort ran thru all elements in the array
  {
    int partIndex = partitionLB(arr, start, end); // sort array and get partition index
    QuicksortLB(arr, start, partIndex - 1);       // redo recursevely for each subarray
    QuicksortLB(arr, partIndex + 1, end);
  }
}

// Versions with Steps===================================================

// QuickSort ===================================================================

int partitionHAS(int arr[], int start, int end)
{ // Hoarse
  int pivot = arr[start];
  steps++; // +1 to assign variable

  int i = start, j = end;
  steps += 2; // +2 for variable assignment
  while (i < j)
  {
    steps += 1; // +1 for while loop
    do
    {
      steps += 2; // +2 for do-while loop
      i++;
      steps++; // +1 for variable incrementation
    } while (arr[i] < pivot);
    do
    {
      steps += 2; // +2 for do-while loop
      j--;
      steps++; // +1 for variable decrementation
    } while (arr[j] > pivot);
    if (i < j)
      swap(arr[i], arr[j]);
    steps += 3; // +3 for swap
    steps++;    // +1 for if
  }
  swap(arr[start], arr[j]);
  steps += 3; // +3 for swap
  return j;
}
void quickSortHAS(int arr[], int start, int end)
{
  steps++; // initialize step
  if (start < end)
  {
    int pivot = partitionHAS(arr, start, end);
    steps++; // +1 to assign variable
    steps++; // +1 for function call
    quickSortHAS(arr, start, pivot);
    steps++; // +1 for function call
    quickSortHAS(arr, pivot + 1, end);
    steps++; // +1 for function call
  }
  steps++; // +1 for if
}
int partitionHBS(int arr[], int start, int end)
{
  int pivot = arr[start];
  steps++; // +1 to intialize variable
  int i = start, j = end;
  steps++; // +1 to intialize variable
  steps++; // +1 to intialize variable
  while (i < j)
  {
    steps += 1; // +1 for while loop

    do
    {
      steps += 2; // +2 for do-while loop
      i++;
      steps++; // +1 for variable incrementation
    } while (arr[i] > pivot);
    do
    {
      j--;
      steps++; // +1 for variable decrementation
    } while (arr[j] < pivot);
    if (i < j)
    {
      swap(arr[i], arr[j]);
      steps += 3;
    }        // +3 for swap
    steps++; // +1 for if
  }

  swap(arr[start], arr[j]);
  steps += 3; // +3 for swap
  return j;
}
void quickSortHBS(int arr[], int start, int end)
{
  steps++; // initialize step
  if (start < end)
  {
    int pivot = partitionHBS(arr, start, end);
    steps++; // +1 to assign variable
    steps++; // +1 for function call
    quickSortHBS(arr, start, pivot);
    steps++; // +1 for function call
    quickSortHBS(arr, pivot + 1, end);
    steps++; // +1 for function call
  }
  steps++; // +1 for if
}

int partitionLAS(int arr[], int start, int end) // Lamuto
{

  int pivot = arr[end];
  steps++; // +1 to assign variable
  int j = start - 1;
  steps++; // +1 to assign variable
  for (int i = start; i <= end - 1; i++)
  {
    steps += 3; // +3 for loop
    if (arr[i] <= pivot)
    {
      j++;
      steps++; // +1 for variable incrementation
      swap(arr[j], arr[i]);
      steps += 3; // +3 for swap
    }
    steps++; // +1 for if
  }
  swap(arr[j + 1], arr[end]);
  steps += 3; // +3 for swap
  return (j + 1);
  steps++; // +1 for return
}

void QuicksortLAS(int arr[], int start, int end)
{
  steps++; // initialize step
  if (start < end)
  {
    int partIndex = partitionLAS(arr, start, end);
    steps++; // +1 to assign variable
    steps++; // +1 for function call
    QuicksortLAS(arr, start, partIndex - 1);
    steps++; // +1 for function call
    QuicksortLAS(arr, partIndex + 1, end);
    steps++; // +1 for function call
  }
  steps++; // +1 for if
}

int partitionLBS(int arr[], int start, int end)
{

  int pivot = arr[end];
  steps++; // +1 to assign variable
  int j = start - 1;
  steps++; // +1 to intialize variable
  for (int i = start; i <= end - 1; i++)
  {
    steps += 3; // +3 for loop
    if (arr[i] >= pivot)
    {
      j++;
      steps++; // +1 for variable incrementation
      swap(arr[j], arr[i]);
      steps += 3; // +3 for swap
    }
    steps++; // +1 for if
  }
  swap(arr[j + 1], arr[end]);
  steps += 3; // +3 for swap
  return (j + 1);
  steps++; // +1 for function call
}

void QuicksortLBS(int arr[], int start, int end)
{
  if (start < end)
  {
    int partIndex = partitionLB(arr, start, end);
    steps++; // +1 for function call
    steps++; // +1 to assign variable
    QuicksortLBS(arr, start, partIndex - 1);
    steps++; // +1 for function call
    QuicksortLBS(arr, partIndex + 1, end);
    steps++; // +1 for function call
  }
  steps++; // +1 for if
}