Also , there is a pretty nice theorem on the fact that , if an array's size is increased/decreased by a constant size (like in STL vector class), the sequence of these doubling operations always take place O(1) time .
On Jan 30, 3:44 pm, juver++ <avpostni...@gmail.com> wrote: > 1. Add element to the end of the array. > 2. Find median of the array, and partion the array into two sets, the second > one (where element >= median) is removed. > > At each operation 2, array's size decreasing by factor 0.5. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
