Domanda di colloquio di Amazon
Find the kth smallest number in an unsorted array with minimum complexity.
Risposte di colloquio
Anonimo
24 lug 2012
we can use max heap of size k. for more info http://www.careercup.com/question?id=14118753
3
Find the kth smallest number in an unsorted array with minimum complexity.
Anonimo
we can use max heap of size k. for more info http://www.careercup.com/question?id=14118753