Fundamentals of algorithms

Question 1

How does linear search work?

Answer 1

Searches throughout the array one by one

Question 2

How does binary search work?

Answer 2

in chronological order, we split the array in half and if the number is smaller than the initial value we disregard that set and repeat until we find the value

Question 3

How does merge sort work?

Answer 3

• Split array into halves and then quarters
• Split until it cannot be divided
• combine together from 2’s to 4’s and swap if values are bigger until in chronological order

Question 4

How does bubble sort work?

Answer 4

go through two elements at a time and swap if number is smaller until in chronological order.