Lecture 1 Flashcards
1
Q
What is the definition of an algorithm?
A
2
Q
What is pseudocode?
A
3
Q
What is the idea of pseudocode?
A
4
Q
What is the InsertionSort algorithm?
A
5
Q
When analyzing the speed of an algorithm what do we focus on?
A
6
Q
What is the asymptotic runtime?
A
7
Q
Why do we use Asymptotic analysis?
A
8
Q
What is the Divide and Conquer method to improve the speed of an algorithm?
A
9
Q
What is the MergeSort algorithm?
A
