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...
Sur cette page du site, vous pouvez voir la vidéo en ligne Reverse Insertion Sorting Algorithm (python) durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Canadian Caleb 27 octobre 2019, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 249 fois et il a aimé 2 téléspectateurs. Bon visionnage!
