Re:“It is never a compiler error”
by openasocket on Wednesday November 15, 2017 @01:20AM
(#15701812)
No, you can't, because at the end of the first pass you have no way to know that it is in sorted order. Go ahead and try to write the pseudocode for your bubble sort implementation that avoids the second pass.
[ Parent
| on HN ]
Re:“It is never a compiler error”
by somecontext on Wednesday November 15, 2017 @07:45AM
(#15703342)
To be concrete, the array in order 1235647 has the first six comparisons go the same way as in 1234657, but it doesn't end up sorted in one pass.
Perhaps harry8 was thinking of the bubble sort implementation in the OP, which would indeed stop after one pass in these cases.