Bubble Sort Notes Day 1

Question 1

What is bubble sort?

Answer 1

a simple sorting algorithm that repeatedly steps through an array, compares adjacent elements and swaps them if they are in the wrong order.

Question 2

how do you swap elements in an array?

Answer 2

array = [“a”, “b”, “c”, “d”] # let’s swap “a” and “b”

array[0], array[1] = array[1], array[0]

p array # => [“b”, “a”, “c”, “d”]

Question 3

How do you implement bubble sort?

Answer 3