Insertion Sort, Algorithms, Data Structure Algorithm, Coding Interviews, Job Hunting.
As we can see 3 will be placed before 5. Now we have our sorted array as 3 5 6. In the same, way we will go further. We will update the key to 1, then compare it with every element of the sorted array, afterward finds its correct position and place it. In the end, we will have our final sorted