MedianFindingAlgorithm-CSESERVICES.pptVIP

Median Finding Algorithm Submitted By: Arjun Saraswat Nishant Kapoor Problem Definition Given a set of n unordered numbers we want to find the k th smallest number. (k is an integer between 1 and n). A Simple Solution A simple sorting algorithm like heapsort will take Order of O(nlg2n) time. Step Running Time Sort n elements using heapsort O(nlog2n) Return the kth smallest element O(1) Total running time O(nlog2n) Linear Time selection algorithm Also called Median Finding Algorithm. Find k th smallest element in O (n) time in worst case. Uses Divide and Conquer strategy. Us