Python: Bubble sort

Python Search and Sorting : Exercise-4 with Solution

Write a Python program to sort a list of elements using the bubble sort algorithm.
Note : According to Wikipedia "Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to insertion sort. It can be practical if the input is usually in sort order but may occasionally have some out-of-order elements nearly in position.

Step by step pictorial presentation :

Bubble sort Algorithm

Sample Solution:

Python Code:

def bubbleSort(nlist):
    for passnum in range(len(nlist)-1,0,-1):
        for i in range(passnum):
            if nlist[i]>nlist[i+1]:
                temp = nlist[i]
                nlist[i] = nlist[i+1]
                nlist[i+1] = temp

nlist = [14,46,43,27,57,41,45,21,70]

Sample Output:

[14, 21, 27, 41, 43, 45, 46, 57, 70]


Flowchart: Python Data Structures and Algorithms: Bubble sort

Python Code Editor :

Contribute your code and comments through Disqus.

Previous: Write a Python program for binary search for an ordered list.
Next: Write a Python program to sort a list of elements using the selection sort algorithm.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

Follow us on Facebook and Twitter for latest update.