Skip to content

v0.1 - stable working implementations of Bubble Sort, Insertion Sort, Shell Sort, Comb Sort, Quick Sort
Compare
Choose a tag to compare
@bxparks bxparks released this 05 Aug 06:02
· 46 commits to master since this release
v0.1
c8ab6b1
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.
  • v0.1 (2021-08-04)
    • Add combSort133() which uses a gap factor of 4/3, which eliminates
      integer division. Smaller and faster on 8-bit processors which don't have
      hardware integer division.
    • Add combSort13m() and combSort133m() which modifies the gap to 11 when
      equal to 9 and 10.
    • Add WorstCaseBenchmark to determine behavior at extremes (already
      sorted, and reversed sorted).
    • Add comparison to C library's builtin qsort(). Seems like it's 2-3X
      slower and consumes 4-5X more flash memory than quickSortXxx().
    • Add unit tests.
  • Initial checking (2021-08-02)
Assets 2
Loading