Best Case for Bubble Sort

algorithm bubble-sort
Yash picture Yash · Aug 31, 2009 · Viewed 49.1k times · Source

I want to know what will be the best case for a bubble sort ? There may be a case wherein there may be no swapping for the say last 2 passes for example. I'm doing my program in C language. Suppose i have an array of 5 elements and i give the elements as 1 2 5 4 3 then there would be no change in the last 2 passes?

Answer

jgallant picture jgallant · Aug 31, 2009

Best case scenario is one pass. The list would already be sorted.
No swap = done.

Related questions

Bubble Sort Homework

In class we are doing sorting algorithms and, although I understand them fine when talking about them and writing pseudocode, I am having problems writing actual code for them. This is my attempt in Python: mylist = [12, 5, 13, 8, 9, 65] def bubble(badList): length = …

Read More
What is a bubble sort good for?

Do bubble sorts have any real world use? Every time I see one mentioned, it's always either: A sorting algorithm to learn with. An example of a sorting algorithm not to use.

Read More
Why is bubble sort O(n^2)?

for (int front = 1; front < intArray.length; front++) { for (int i = 0; i < intArray.length - front; i++) { if (intArray[i] > intArray[i + 1]) { int temp = intArray[i]; intArray[i] = intArray[i + 1]; intArray[i + 1] = temp; } } } The inner loop is iterating: …

Read More