Algorithm Analysis
What is the Big O for searching on an unsorted list
O(N)
What is the Big O for quick sort in worst case scenario
O(N^2)
What is the Big O for polynomial algorithms
O(N^3)
What is the Big O for for quick sort in average case scenario
O(NlogN)
What is the Big O for merge sort in average case scenario
O(NlogN)
What is the Big O for merge sort in worst case scenario
O(NlogN)
What is the Big O for modern sorting algorithms
O(NlogN)
What are some typical examples for O(1)
assigning a constant to a variable
What are some typical examples for O(NlogN)
modern sorting algorithm
What are some typical examples for O(N^2)
nested for-loops
What are some typical examples for O(N!)
optimization and brute force
What are some typical examples for O(logN)
searching on a sorted list
What are some typical examples for O(N)
searching on an unsorted list