Ask your own question, for FREE!
Computer Science 15 Online
OpenStudy (anonymous):

device an algorithm to find the k th largest element in a unsorted list.

OpenStudy (anonymous):

the algo shud have a linear complexity..... i found smthin with complexity of O(k*N) with a worst case of O(N*N)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!