Repository navigation
Expand file tree
/
Copy path184. bubble_sort_2.c
More file actions
82 lines (72 loc) · 1.81 KB
/
Copy path184. bubble_sort_2.c
File metadata and controls
82 lines (72 loc) · 1.81 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
/**
* worst-case: O(n^2)
* best-case: O(n)
* average-complexity: O(n^2)
*
*/
#include <stdlib.h> /// for rand() calls
#include <assert.h> /// for assert(<expr>)
#include <stdbool.h> /// for boolean values: true, false
#define MAX 20
/**
* @brief Bubble sort implementation
* @param array_sort the array to be sorted
* @returns void
*/
void bubble_sort(int* array_sort)
{
bool is_sorted = false;
/* keep iterating over entire array
* and swaping elements out of order
* until it is sorted */
while (!is_sorted)
{
is_sorted = true;
/* iterate over all elements */
for (int i = 0; i < MAX - 1; i++)
{
/* check if adjacent elements are out of order */
if (array_sort[i] > array_sort[i + 1])
{
/* swap elements */
int change_place = array_sort[i];
array_sort[i] = array_sort[i + 1];
array_sort[i + 1] = change_place;
/* elements out of order were found
* so we reset the flag to keep ordering
* until no swap operations are executed */
is_sorted = false;
}
}
}
}
/**
* @brief Test implementations
* @returns void
*/
static void test() {
/* simple int array for testing */
int array_sort[MAX] = {0};
/* populate our test array with
* random integer numbers */
for (int i = 0; i < MAX; i++)
{
array_sort[i] = rand() % 101;
}
/* sort array */
bubble_sort(array_sort);
/* check if array ir correctly ordered */
for (int i = 0; i < MAX - 1; i++)
{
assert(array_sort[i] <= array_sort[i+1]);
}
}
/**
* @brief Main function
* @returns 0 on exit
*/
int main()
{
test(); // run self-test implementations
return 0;
}