The insertion sort algothim is a basic computer science algorithm that works well for sorting nearly sorted or small data sets. In this video tutorial, I will show you how to code out the insertion sort algorithm in javascript es6 as well as explain the logic behind it. We will visualize the code through our terminal on repl.it and keep notes in the comments.

Thank you all for watching this tutorial, if it helped you please leave a like and consider subscribing for more coding content!

Example:
[ 4, 1, 5, 3 ]

[ 1 ], [ 4, 5, ,3]

[ 1 ,4, 5, 3 ]

[ 3 ], [ 1, 4, 5 ]

[ 1, 3, 4, 5 ]

Code: https://repl.it/@Trip4077/FearlessSimultaneousBooleanlogic

Music: www.bensound.com

Twitter: https://twitter.com/Bernard88313685

Original source