# Introduction Insertion sort is a simple sorting algorithm that works by repeatedly inserting the next element in the sorted array. It is an in-place comparison-based sorting algorithm that builds the final sorted array one item at a time.
Click the virtual machine below to start practicing