Flash minsort is a fast sorting algorithm for embedded devices with minimal memory. The algorithm was published in IDEAS 2010 (paper). This version is specifically for the Arduino.
Flash minsort has the following benefits:
- Minimum memory usage of less than 1 KB.
- Very efficient at sorting data that is partially sorted.
- No use of dynamic memory (i.e. malloc()).
- Easy to use and include in existing projects.
- Open source license. Free to use for commerical and open source projects.
- flash_minsort.c, flash_minsort.h - implementation of flash minsort
- test_flash_minsort.h - test file
- in_memory_sort.c, in_memory_sort.h - implementation of quick sort
- serial_c_interface.c, serial_c_interface.h - serial output for Arduino
- ion_file.c, ion_file.h - file abstraction for files on SD card