Can anyone explain how to improve the quicksort algorithm for finding the median of n odd numbers and what will be the worst case scenario 开发者_Python百科for that algorithm? Please help.
http://en.wikipedia.org/wiki/Selection_algorithm#Partition-based_general_selection_algorithm
 
         
                                         
                                         
                                         
                                        ![Interactive visualization of a graph in python [closed]](https://www.devze.com/res/2023/04-10/09/92d32fe8c0d22fb96bd6f6e8b7d1f457.gif) 
                                         
                                         
                                         
                                         加载中,请稍侯......
 加载中,请稍侯......
      
精彩评论