Friday, May 13, 2011

Code to find the nth smallest number in linear time.

The program here uses technique of partitioning used in quick sort. Each time out of two partitions, one partition is rejected. With just one smaller partiton to work upon. To Know more and view code Click here.

No comments:

Post a Comment