@Pureferret That's no problem. This is just bubblesort going both ways. It starts by taking the first non-sorted element and as it progresses it checks to see if it can find a element that's bigger than the reference. If it does it switches to use the new largest element as reference. Once it reaches the end it has found the next element and therefore marks it as sorted. Going back is the same thing except it tries to find the smallest non-sorted element.
Hows does it work when the elements aren't evenly spaced, i.e. with gaps?
Pureferret 11 months ago
@Pureferret That's no problem. This is just bubblesort going both ways. It starts by taking the first non-sorted element and as it progresses it checks to see if it can find a element that's bigger than the reference. If it does it switches to use the new largest element as reference. Once it reaches the end it has found the next element and therefore marks it as sorted. Going back is the same thing except it tries to find the smallest non-sorted element.
SilkSwe 9 months ago
@SilkSwe So it just picks an element, check it against all unsorted elements and then swaps things around? makes sense :)
Pureferret 8 months ago