2 ms·
remarkable, thank you all of the bubble sorts i tried compiling in this thread ended up being compiled to code with either conditional branches or (on arm thum
by kragen 3y ago
remarkable, thank you
all of the bubble sorts i tried compiling in this thread ended up being compiled to code with either conditional branches or (on arm thumb-2) a couple of conditionalized stores. but conditional stores don't require a pipeline flush, and it is of course perfectly correct that insertion sort depends on its inner loop having an unpredictable branch to get better performance on almost-sorted data, which bubble sort does not
- kragen 3y agoafter thinking about it some more, i was skeptical that this really implements bubble sort, but after trying it, it does python version of the inner loop max_ = arr[0] for j in range(1, i): y = arr[j] arr[j - 1] = min(max_, y) max_ = max(max_, y) arr[i - 1] = max_