Bubble Sort and Complexity

MediumPython

Problem

Write the code of bubble sort and explain its time and space complexities.

Implement bubble_sort(arr) to sort a list of integers in ascending order and return the sorted list. The algorithm must sort the input in place and should stop early when a complete pass makes no swaps.

Use only constant extra space. State the best-case, average-case, worst-case time complexities and the auxiliary space complexity.

Constraints

0 <= len(arr) <= 500
-10^9 <= arr[i] <= 10^9
The input list must be sorted in place
Return the same list object after sorting

Function Signature

def bubble_sort(arr):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.