Interview Question

Anonymous Interview Bangalore (India)

Find the kth smallest number in an unsorted array with

  minimum complexity.
Tags:
algorithm
Answer

Interview Answer

2 Answers

0

Use partitioning so that sorting is not required.

Interview Candidate on Jun 19, 2012
2

we can use max heap of size k.
for more info http://www.careercup.com/question?id=14118753

Anonymous on Jul 23, 2012

Add Answers or Comments

To comment on this question, Sign In with Facebook or Sign Up