| 1 | #include "utils.h" |
| 2 | #include "sort.h" |
| 3 | |
| 4 | bool is_even(int a) { |
| 5 | return (a % 2 == 0); |
| 6 | } |
| 7 | |
| 8 | bool is_odd(int a) { |
| 9 | return (a % 2 != 0); |
| 10 | |
| 11 | } |
| 12 | |
| 13 | bool ascending(int a, int b) { |
| 14 | return a > b; |
| 15 | } |
| 16 | |
| 17 | bool descending(int a, int b) { |
| 18 | return a < b; |
| 19 | } |
| 20 | |
| 21 | bool ascending_and_even(int a, int b) { |
| 22 | return (((a % 2 != 0) && (b % 2 == 0)) || ((a % 2 == 0) && (b % 2 == 0) && ascending(a, b)) \ |
| 23 | || ((a % 2 != 0) && (b % 2 != 0) && ascending(a, b))); |
| 24 | } |
| 25 | |
| 26 | bool ascending_and_odd(int a, int b) { |
| 27 | return (((a % 2 == 0) && (b % 2 != 0)) || ((a % 2 == 0) && (b % 2 == 0) && ascending(a, b)) \ |
| 28 | || ((a % 2 != 0) && (b % 2 != 0) && ascending(a, b))); |
| 29 | } |
| 30 | |
| 31 | static bool sort_first(int* array, unsigned length, s_criteria_cb sort_criteria) { |
| 32 | bool rt = false; |
| 33 | for (unsigned i = 0; i < length-1; i++) { |
| 34 | if (sort_criteria(array[i], array[i+1])) { |
| 35 | swap_int(&array[i], &array[i+1]); |
| 36 | rt = true; |
| 37 | } |
| 38 | } |
| 39 | return rt; |
| 40 | } |
| 41 | |
| 42 | /* the feature of this function is awaited in the array.c file */ |
| 43 | void sort_bubble_array(int* array, unsigned length, s_criteria_cb sort_criteria) { |
| 44 | bool rt; |
| 45 | do { |
| 46 | rt = sort_first(array, length, sort_criteria); |
| 47 | } while (rt); |
| 48 | } |