41 lines
845 B
C
41 lines
845 B
C
/* SPDX-License-Identifier: GPL-2.0-only */
|
|
|
|
#include <commonlib/helpers.h>
|
|
#include <commonlib/sort.h>
|
|
|
|
/* Implement a simple Bubble sort algorithm. Reduce the needed number of
|
|
iterations by taking care of already sorted entries in the list. */
|
|
void bubblesort(int *v, size_t num_entries, sort_order_t order)
|
|
{
|
|
size_t i, j;
|
|
int swapped;
|
|
|
|
/* Make sure there are at least two entries to sort. */
|
|
if (num_entries < 2)
|
|
return;
|
|
|
|
for (j = 0; j < num_entries - 1; j++) {
|
|
swapped = 0;
|
|
for (i = 0; i < num_entries - j - 1; i++) {
|
|
switch (order) {
|
|
case NUM_ASCENDING:
|
|
if (v[i] > v[i + 1]) {
|
|
SWAP(v[i], v[i + 1]);
|
|
swapped = 1;
|
|
}
|
|
break;
|
|
case NUM_DESCENDING:
|
|
if (v[i] < v[i + 1]) {
|
|
SWAP(v[i], v[i + 1]);
|
|
swapped = 1;
|
|
}
|
|
break;
|
|
default:
|
|
return;
|
|
}
|
|
}
|
|
if (!swapped)
|
|
break;
|
|
}
|
|
}
|