BubbleSort | Adv. Algorithms & Data Structures, Hacker Hero

(12/37)

Objectives
Table of Contents

If you were to go through 10-15 interviews, chances are that you'll be asked questions related to sorting and orders of operations.

To prepare you for these type of interview questions, we want you to get very familiar with 'bubble sort'. If someone asks you to whiteboard bubble sort or code out 'bubble sort' while they are watching, you should be able to do this easily.

Through this challenge, implement 'bubblesort' and do it until you can implement the whole process within a minute. We understand if this is your very first time implementing bubble sort, it will take you more than a minute. Just keep trying until you can do it a lot faster. With enough repetitions, you will be able to do this very quickly.

Below is a demonstration of how bubble sort works. Basically this sorting, compares two values next to each start and swaps them if the right value is less than the left value. It repeats this process n times (where n is the number of values in the array).

(0/3) Solved

Community

#		Player	Votes	Replay

Test Cases (0/4)

bubbleSort([5,3,1,2]) to return [1,2,3,5]
bubbleSort([5,4,3,2,1]) to return [1,2,3,4,5]
bubbleSort([5, 3, 1, -1, -3]) to return [-3,-1,1,3,5]
bubbleSort([5, 3, 1]) to return [1,3,5]

Output

Michael

Test Cases (0/4)

Output

Run Your Code

Run Your Code

Community Tab

Credits