Thanks Prashant. But as far as i know, if i apply sorting by CREW, the time complexity would increase. I need time complexity O(n) for a part. Do u have any idea where i don't need to sort the array.?
On Dec 9, 3:14 am, Prashant K <[email protected]> wrote: > hi > u can use Algorithm like CREW (parallel sorting algorithms) > > > > > > On Wed, Dec 9, 2009 at 1:22 PM, sankethm7 <[email protected]> wrote: > > Hello folks, > > does anyone have idea to solve the problem given below: > > > Assume that A[1…n] is an array > > a. Describe an efficient parallel algorithm that uses n processors to > > find the majority element of A > > time complexity = O(n) > > b. Describe an efficient parallel algorithm that uses p processors, > > where p<<n, to find A’s majority element. > > time complexity = O(n/p + log(base 2) t) > > > -- > > > 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. > > -- > > Prashant Kulkarni -- 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.
