Algorithms Flashcards
1
Q
What is big O notation?
A
Upper bound for the time complexity of algorithms
2
Q
What is theta notation?
A
The average case scenario time complexity of algorithms
3
Q
What is omega notation?
A
The lower bound time complexity of algorithms.
4
Q
What are the three types of sorting algorithms?
A
Merge, bubble, selection
5
Q
What are the two types of searching algorithms?
A
Linear & binary
