The idea is to init a heap "the smallest element first", and add all elements from the array into this heap one by one keeping the size of the heap always less or equal to k. That would results in a ...

After completion of each pass, the two largest elements are placed at the end of an array in sorted order. ECLIPSE has been used for the code of sorting an array with Backtrack implemented in Java and ...