Basic interview question

Given an array of n elements and an integer k where k≤n. Elemnts a[0].....a[k] and a[k+1].....a[n] are already sorted. Give an algorithm to sort in O(n) time and O(1) space