Sorting with animation

[Mikl__]

Fifth part

[HSE]

Fantastic 

[jj2007]

Fifth part

Hi Mikl,

Sounds good but I can't see an animation, and the "translated" zip archive isn't found...

A multiple run through the array is performed, neighboring elements are compared and, if necessary, swapped. When the end of the array is reached, the direction is reversed. While moving to the beginning of the array, we find the maximum element and change it with the element that is at the end of the array. This pushes the minimum element to the beginning of the array. While moving to the end of the array, we find the minimum element and change it with the element that is at the beginning of the array. In this case, the maximum element is pushed to the end of the array. Thus, simultaneously during one pass, the maximum and minimum elements of the end and beginning of the array are filled.

https://en.wikipedia.org/wiki/Cocktail_shaker_sort

[HSE]

Hi JJ!

Just now I realise how was that:

https://wasm.in/threads/sortirovki-s-animaciej.34674/page-5

[zedd151]

lol. I had never heard of that sorting algorithm before (cocktail shaker sort). But I once made a sorting algorithm that I called a bidirectional sort which worked very similarly (reversing direction, etc)  if not very slowly.   
Nice graphic of its implementation. Thankfully I had stopped experimenting with home brew sorting algos in favor of tried and trued methods, which of course are always much faster than anything I could dream up. It was fun though.

[jj2007]

Hi JJ!

Just now I realise how was that:

https://wasm.in/threads/sortirovki-s-animaciej.34674/page-5

Thanks, Hector, works like a charm

[Mikl__]

Sounds good but I can't see an animation, and the "translated" zip archive isn't found...

Hi jj2007!
This is especially for you!

[jj2007]

Thanks, Mikl

[Mikl__]

Insertion sort

[jj2007]

Very nice animation, Mikl

[Mikl__]

Insertion sort (binary search)

[Mikl__]

Pairwise Insertion Sort

[Mikl__]

Pigeonhole Sort

[Mikl__]

Bucket sort

[Mikl__]

Thanos sort