W2232 Big-O Notation
From Coder Merlin
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
Prerequisites[edit]
Background[edit]
- Watch Introduction to Big O Notation and Time Complexity (CS Dojo)
Exercises[edit]
Exercises
Write an essay (minimum 500 words) which:
- Defines Big-O
- Compares and contrasts Big-O for:
- Bubble-Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Based upon the above, which sort is most time-efficient for the average case?
Complete your essay in your Journal directory and push to GitHub.