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...
На этой странице сайта вы можете посмотреть видео онлайн Reverse Insertion Sorting Algorithm (python) длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Canadian Caleb 27 Октябрь 2019, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 249 раз и оно понравилось 2 зрителям. Приятного просмотра!
