7 ms·
It's probably because the implementation of the algorithm is the simplest, because you don't need to modify the existing data structure. You don't need to merge
by NeoBasilisk 7y ago
It's probably because the implementation of the algorithm is the simplest, because you don't need to modify the existing data structure. You don't need to merge or create new arrays. You just repeatedly loop and swap two elements when needed. Super easy by all metrics.
- vengefulduck 7y agoYou don’t need to modify the data structure for most quadratic sorts though. Or even for quick sort.
- BubRoss 7y agoMost people get the partition algorithm wrong on their first try if they write it themselves.