Lecture 2 Flashcards
1
Q
What is the definition of the big-O notation?
A
2
Q
How to prove big-O bounds?
A
3
Q
How to disprove big-O bounds?
A
4
Q
What is the definition of big-Omega?
A
5
Q
What is the definition of big-Theta?
A
6
Q
What are the steps to prove the correctness of an algorithm using induction?
A
7
Q
How do you prove the correctness of algorithms with iterative and recursive algorithms?
A
8
Q
Give an informal proof of InsertionSort.
A
9
Q
Give a (more) formal proof of the maintenance stage of InsertionSort.
A
10
Q
What is the inductive hypothesis of the MergeSort algorithm?
A
11
Q
Give the proof of the MergeSort algorithm.
A
12
Q
What is the InsertionSort algorithm?
A
13
Q
What is the MergeSort algorithm?
A
