4 ms·

Sorting with Fibonacci Numbers and a Knuth Reward Check

• zvr 10mo ago
  Fascinating!
  • ncruces 10mo ago
    Indeed. I implemented a gap sequence not analyzed here (Gonnet & Baeza-Yates) and it's amazing how compact Shell sort can be. C: https://github.com/ncruces/go-sqlite3/blob/main/sqlite3/libc/stdlib.h https://github.com/ncruces/go-sqlite3/blob/main/sqlite3/libc... Go: https://github.com/ncruces/sort/blob/main/shell/shell.go https://github.com/ncruces/sort/blob/main/shell/shell.go