diff options
Diffstat (limited to 'src/commonlib/sort.c')
-rw-r--r-- | src/commonlib/sort.c | 49 |
1 files changed, 49 insertions, 0 deletions
diff --git a/src/commonlib/sort.c b/src/commonlib/sort.c new file mode 100644 index 0000000000..40999397c8 --- /dev/null +++ b/src/commonlib/sort.c @@ -0,0 +1,49 @@ +/* + * This file is part of the coreboot project. + * + * Copyright (C) 2019 Siemens AG + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; version 2 of the License. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#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; + + 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; + } +} |