Performing binary search on an sorted array costs O(logn) and inserting data into a linked list costs O(1). So if we take the advantages of both array and linked list, there will be an O(nlogn) sorting algorithm. Isn't it wonderful? But I don't see anyone is working on this idea. Is it impossible?
