Difference between revisions of "W2232 Big-O Notation"
From Coder Merlin
(Created page with "thumb|link=|Big-O == Prerequisites == * W1352 Bubble Sort * W2202 Insertion Sort * W2203 Selection Sort * W2225 Merge Sort == Background =...") |
|||
| Line 8: | Line 8: | ||
* 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) | ||
== Exercises == | == Exercises == | ||
{{W2232-Exercises}} | |||
Revision as of 18:37, 19 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)
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.
