- Start loop from 1 to k
- pick an element and compare with the elements in the sorted list and place them in the sorted list.
- now loop for the last k elements.
- pick an element and compare with the elements in the sorted list and place them in the sorted list.

Well it looks like we are doing insertion sort algo. and its T.C. will be O(n*k) and since k is constant it will be O(n).