Well parallel bubble sort requires more than one processor. When dealing with algorithms we usually consider just one processor. In fact as per the link you are using O(n) processors. The number of comparisons (which is what the complexity is) you are doing overall is not less than O(n^2). Parallelizing a problem does not reduce its complexity.
-Dhyanesh On 4/24/06, Mukul Gandhi <[EMAIL PROTECTED]> wrote: > > Please see here > http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Sorting/bubbleSort.htm > > It says the parallel time complexity of this algorithm is O(n).. > > Regards, > Mukul > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
