3 ms·

Bubble sort is optimal for sorting data stored on tapes (no random access possible). If you have RAM, insertion sort is strictly superior (both simpler code + b

by ynik 3y ago

Bubble sort is optimal for sorting data stored on tapes (no random access possible). If you have RAM, insertion sort is strictly superior (both simpler code + better performance).

dataflow 3y ago
Fascinating, thanks!
Someone 3y ago
On tapes (plural ≥ 3), isn’t merge sort the way to go? I just coarsely checked TAOCP volume 3, and didn’t see bubble sort mentioned in the chapter on external sorting.