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...
On this page of the site you can watch the video online Reverse Insertion Sorting Algorithm (python) with a duration of hours minute second in good quality, which was uploaded by the user Canadian Caleb 27 October 2019, share the link with friends and acquaintances, this video has already been watched 249 times on youtube and it was liked by 2 viewers. Enjoy your viewing!
