In a array of n element first k(<=n)element is sorted ascending and remain n-k sorted in descending

Question

make sure program should be efficent

Answer 1

You can not do better than n*log(n). There are lot of sorting algorithm meeting this condition (e.g. bubble sort)