Difference between revisions of "W2232 Big-O Notation"

From Coder Merlin
Line 7: Line 7:
== Background ==
== Background ==
* Watch [https://www.youtube.com/watch?v=D6xkbGLQesk Introduction to Big O Notation and Time Complexity] (CS Dojo)
* Watch [https://www.youtube.com/watch?v=D6xkbGLQesk Introduction to Big O Notation and Time Complexity] (CS Dojo)
* Read [https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/ A beginner's guide to Big O notation] (Rob Bell)
== Exercises ==
== Exercises ==
{{W2232-Exercises}}
{{W2232-Exercises}}

Revision as of 19:02, 19 April 2020

Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
Big-O

Prerequisites[edit]

Background[edit]

Exercises[edit]

ExercisesExercisesIcon.png

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.