For different data structures such as linked lists, arrays (sorted/unsorted, trees etc. of size n, what is the worst-case time-complexity of finding the n/2 smallest values in each of them? Is it the same as the complexity for Find operations?
Edit: So, what s the complexity for these data structures? Unsorted Linked list, unsorted array, splay trees and hash tables?