Reverse Insertion Sorting Algorithm (python)
This is an insertions sorting algorithm that I made, this way of sorting is very ineffective with larger arrays, but decent with small arrays.
the equation for the speed at which the algorithm sorts is : speed = starting numbers / number of unsorted numbers.
It works like this because as soon as a number is in its designated position, it no longer needs to have any math done to it, and therefore is glossed over by the program.
The video stutters a lot, I had to clear after I printed because whenever writing it i couldn't us end="\r" to make it take up one line considering larger arrays will take up multiple.
Code : https://github.com/CanadianCaleb/Sort...
Nesta página do site você pode assistir ao vídeo on-line Reverse Insertion Sorting Algorithm (python) duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Canadian Caleb 27 Outubro 2019, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 249 vezes e gostou 2 espectadores. Boa visualização!
