btholt / four-semesters-of-cs

https://frontendmasters.com/courses/computer-science/
668 stars 224 forks source link

Changing notation used for Big O #6

Open LindsayElia opened 7 years ago

LindsayElia commented 7 years ago

in line 111 which later refers to merge sort. As a beginner I was confused when I got to line 228 and the notation was different. I believe loglinear time O(n log n) is what is being referred to here since it mentions divide and conquer?