Answers.com > Wiki Answers > Categories > Technology > Computers > Computer Programming > Between merge sort quick sort and bubble sort which is the best?

Between merge sort quick sort and bubble sort which is the best?

In: Computer Programming, Java Programming, C Programming [Edit categories]

Answer:

Among those three, you can automatically discard bubble sort as the worst in general cases (it actually performs quite well when the list of numbers are already in order, unlike quick sort).

In general, merge sort is O(n log n) and quick sort is O(n log n). The two main differences are that 1) quick sort can have a degradation in performance if the pivot point is chosen poorly (O(n²)), 2) quick sort does not require the extra storage that merge sort does.

While I'm not an algorithms expert, I do know that most people tend to err on the side of using quick sort. I have never actually seen anyone implement a merge sort when they had a choice.

First answer by Moobler. Last edit by Sumeet.bagrecha. Contributor trust: 0 [recommend contributor ]. Question popularity: 4 [recommend question].

[report abuse]

Can you answer these Computer Programming questions?

	What programming language do most steam games use?	Answer it!
	What are the principles of freedom?	Answer it!
	How c programming language is related to assembly programming language?	Answer it!
	How much does an Application Programmer earn yearly?	Answer it!
	What are onscreen lists of command choices?	Answer it!

Relevant answers:

Between merge sort and quick sort which is best?
Statistically both MergeSort and QuickSort have the same average case time: O(nlog(n)); However there are various differences. Most implementations of Mergesort, require additional scratch space,...
Who is better quick sort or merge sort?
quick sort is better,bcoz it doesn't take extra space of memory...
What are the merits and demerits of merge sort and quick sort?
merge sort is a stable sort, parallelizes better, and is more efficient at handling slow-to-access sequential media. Merge sort is often the best choice for sorting a linked list: in this situation...
What is the difference between bubble sort and selection sort in pascal?
The traditional bubble sort moves any number of elements at most one position per iteration, while selection sort moves exactly one element per iteration. Both sorts require an exponential amount of...
Can bubble sort perform better than quick sort?
No, it can not. To find out why bubble sort is worse then quick sort we should look at the performance of both methods expressed in Big-O notation (time or special operations count that is needed to...