Week 3 - Algorithms

Question 1

How does Merge sort work?

Answer 1

It sorts smaller arrs and combine them together (merge them) on a sorted order

Question 2

What’s Merge sort’s pseudocode?

Answer 2

1. Sort the left half of the arr
2. Sort the right half of the arr
3. Merge the two halves together

Question 3

What’s Merge sort’s O?

Answer 3

n log n

Question 4

What’s Merge sort’s Ω?

Answer 4

n log n

Question 5

How does Insertion sort work?

Answer 5

It shifts elements out of the way if necessary to make room for smaller elements