/external_merge_sort_iterator_block

External Merge Sort

Primary LanguageCBSD 3-Clause "New" or "Revised" LicenseBSD-3-Clause

External Merge Sort

Efficient implementation of external merge sort for embedded devices.

The external merge sort has the following benefits:

  1. Minimum memory usage is only three page buffers.
  2. No use of dynamic memory (i.e. malloc()).
  3. Easy to use and include in existing projects.
  4. Open source license. Free to use for commerical and open source projects.

License

License

Code Files

  • external_merge_sort_iterator_block.c, external_merge_sort_iterator_block.h - implementation of external merge sort
  • test_external_merge_sort_block.c - test file

Ramon Lawrence
University of British Columbia Okanagan