| title | type | duration | creator | ||||
|---|---|---|---|---|---|---|---|
Big-O |
lab |
0:45 |
|
Note: This can be a pair programming activity or done independently.
In this lab, you will be calculating Big O (worst case performance) of various sorting algorithms.
- Calculate Big O for Insertion Sort with an explanation
- Calculate Big O for Merge Sort with an explanation
- Calculate Big O for Selection Sort with an explanation
Bonus:
- Calculate Big O for Quick Sort with an explanation
In the starter-code folder, you will find code for the 4 algorithms.
Below each method, write the Big O analysis as well as an explanation for how you came to that conclusion.