Can you illustrate it with an example ? How are you deciding the pivot for partitioning the array ? How the middle element can be the mode of the array ?
Regards Gauri On Apr 14, 5:39 pm, vivek bijlwan <[email protected]> wrote: > complexity : On) > extra - memory required : no > > have the first iteration of quick sort. return the middle element. > > > > On Wed, Apr 14, 2010 at 4:14 PM, Gauri <[email protected]> wrote: > > Say If I have an array of 1,000 32-bit integers .And one of the value > > is occuring 501 number of times or more in the array. Can someone help > > me devise an efficient algorithm for the same ? > > > Thanks & Regards > > Gauri > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]<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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
