FindingMedian

This python module finds the median of the numbers enterd in a list with a time complexity of O(nlog(n)), without modifying the list It is way faster than the simple method of first sorting and then taking the mid number as sorting time complexity is usually O(n^2) or at best nlog(n) and it modifies the list

download full project from here :::
http://viahold.com/gAW