Commit 5c75752f authored by Reto Da Forno's avatar Reto Da Forno
Browse files

bubble sort added

parent 683f1be1
......@@ -127,5 +127,6 @@ bool fifo_is_full(const fifo_t fifo);
uint32_t fifo_get_used_space(const fifo_t fifo);
uint32_t fifo_get_free_space(const fifo_t fifo);
void bubble_sort_uint8(uint8_t* a, uint16_t len);
#endif /* __DPP_LIB_H__ */
/*
* Copyright (c) 2021, ETH Zurich, Computer Engineering Group (TEC)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "dpp_lib.h"
/*---------------------------------------------------------------------------*/
/* sorts integer values in increasing order, in-place */
void bubble_sort_uint8(uint8_t* a, uint16_t len)
{
if (!a || !len) {
return;
}
uint32_t n = len - 1;
bool swapped;
do {
swapped = false;
for (uint32_t i = 0; i < n; i++) {
if (a[i] > a[i + 1]) {
uint8_t tmp = a[i + 1];
a[i + 1] = a[i];
a[i] = tmp;
swapped = true;
}
}
n--;
} while (swapped);
}
/*---------------------------------------------------------------------------*/
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment