Insertion Sort - Sorting Algorithms смотреть онлайн

This video is a showcase of an Insertion sort of 300 numbers. The insertion sort works by creating a 'sorted' section to the left side of the list. This list gets numbers added to it in the order they appear in inserting them into their correct position in this smaller sorted list.
The sort looks at the first element in the un-sorted segment and continuously swaps it with the element to its left unless it is smaller than it. This would place the number into its correct position in the sorted section. Once the number's position has been found it checks the next one and so on.

The blue circle is the current lowest number
The pink circle is the number being compared to
Green circles are numbers in their correct position
The Orange/Yellow line is the section that has currently been sorted (based on how the algorithm works)


--- This video does not represent the true speed or effective of the specific sorting algorithm ---


This was programming by myself using Processing which can be found at https://processing.org/download/
Upon installing, addition steps will be required to set up the Python version (Processing.py) which is what I used.



I do not own the rights to the music featured in the video. All rights go to the video:
https://youtu.be/QeAy488CcC8
Please check it out for yourself.