@juvir++ how is the deletion O(1) ? On Sun, Jan 30, 2011 at 4:14 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<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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.
