Reverse Insertion Sorting Algorithm (python)

Pubblicato il: 27 ottobre 2019
sul canale di: Canadian Caleb

249

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...

In questa pagina del sito puoi guardare il video online Reverse Insertion Sorting Algorithm (python) della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Canadian Caleb 27 ottobre 2019, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 249 volte e gli è piaciuto 2 spettatori. Buona visione!

158