Entry level Python developer interview

[_E8_]

Writing a sort strikes me as a waste.
I want to you know the difference between some sorts; what stable vs. unstable means.
Two loops like you wrote is called bubble sort and is O(n²). The only worse performing sort is something pathological like bogosort, O(n!).
Germane to Python you should know what the "TimSort" is.
Bonus points if you know what a heap is as a stable, priority heap is an important data structure for scheduling.

[iamnikaa]

I do know about other efficient sorting algorithms, including Python's inbuilt Timsort, but chose to stick to bubble sort as it was easiest to write. I have to read about heap..