[sdiy] 1 bit serial stream delay approaches..

[Olivier Gillet]

> However O(log n) is for finding an item in a sorted array, right, not sorting the array itself? The best performing sort algorithms are n log n.

O(log n) is for finding an item in a sorted array (through binary
search), but also for inserting/removing an item in the simplest
implementation of a heap - that's this second case I had in mind.