Write a well-documented, Python program, hmwk3Q4.py that implements the Bubble-Sort algorithm. Bubble-Sortiterates over a list of numbers, comparing the elements in pairs and swaps them if the first element in the pair islarger than the second. Swapping continues until the largest number "bubbles" to the top of the list, while the smallestelement stays at the bottom. Implement the algorithm that accepts an unsorted list and returns a sorted one - inascending order.5 3لنا83 5 83 5 833 5 45 44484 6LO66668Initial ListSwapDo Not SwapSwapSwap335 45●●●Bubble Sort Algorithm66882nd PassSwap●●●Nth PassHints:Convince yourself that the algorithm and Python implementation is correct by calling the sorting function with a list[50,20,10,80,40], and printing the sorted result.Your algorithm should use a while-loop to ensure that the ascending order is achieved.

Answered: Write a well-documented, Python…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Write a well-documented, Python program, hmwk3Q4.py that implements the Bubble-Sort algorithm. Bubble-Sort
iterates over a list of numbers, comparing the elements in pairs and swaps them if the first element in the pair is
larger than the second. Swapping continues until the largest number "bubbles" to the top of the list, while the smallest
element stays at the bottom. Implement the algorithm that accepts an unsorted list and returns a sorted one - in
ascending order.
5 3
لنا
8
3 5 8
3 5 8
3
3 5 4
5 4
4
4
8
4 6
LO
6
6
6
6
8
Initial List
Swap
Do Not Swap
Swap
Swap
3
3
5 4
5
●●●
Bubble Sort Algorithm
6
6
8
8
2nd Pass
Swap
●●●
Nth Pass
Hints:
Convince yourself that the algorithm and Python implementation is correct by calling the sorting function with a list
[50,20,10,80,40], and printing the sorted result.
Your algorithm should use a while-loop to ensure that the ascending order is achieved.

Expert Solution

Step 1

CODE IN PYTHON:

def bubbleSort(inputList):
    n = len(inputList)
    for i in range(n-1):
        isSorted = True
        for j in range(n-1):
            if inputList[j] > inputList[j+1]:
                temp = inputList[j]
                inputList[j] = inputList[j+1]
                inputList[j+1] = temp
                isSorted = False
        if isSorted:
            break
    return inputList

inputList = [50, 20, 10, 80, 40]
print("Before sorting : ", inputList)
inputList = bubbleSort(inputList)
print("After sorting: ", inputList)

INDENTATION: