Bubble Sort Mechanics | Dataford Interview Questions

Can you explain the mechanics of the Bubble sort algorithm?

Implement the algorithm as bubble_sort(values). It must rearrange the input array into ascending order and return the sorted array. Compare adjacent elements, swap them when they are out of order, and stop early if a complete pass makes no swaps.

Input and Output

values is an array of integers. Return the same array after sorting it in ascending order.

Constraints

0 <= values.length <= 500
Each value is an integer
Return the input array after sorting it in ascending order

Function Signature

def bubble_sort(values):

Your question is Bubble Sort Mechanics. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem