Difference between revisions of "W2232 Big-O Notation"
From Coder Merlin
| Line 10: | Line 10: | ||
* Read [https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/ A beginner's guide to Big O notation] (Rob Bell) | * Read [https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/ A beginner's guide to Big O notation] (Rob Bell) | ||
* Watch [https://www.youtube.com/watch?v=RGuJga2Gl_k Why My Teenage Code Was Terrible: Sorting Algorithms and Big O Notation] (Tom Scott) | * Watch [https://www.youtube.com/watch?v=RGuJga2Gl_k Why My Teenage Code Was Terrible: Sorting Algorithms and Big O Notation] (Tom Scott) | ||
{{ComingSoon| | |||
* Timing execution in Linux | |||
}} | |||
== Exercises == | == Exercises == | ||
{{W2232-Exercises}} | {{W2232-Exercises}} | ||
Revision as of 19:26, 26 April 2020
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)
- Watch Getting Sorted & Big O Notation (Computerphile)
- Read A beginner's guide to Big O notation (Rob Bell)
- Watch Why My Teenage Code Was Terrible: Sorting Algorithms and Big O Notation (Tom Scott)
 |
Coming Soon |
|
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.
