Time Complexity and Logarithms
I've been practicing evaluating time complexity with Big O notation, and while I can intuitively recognize when an algorithm runs in linear time, constant time, or quadratic time, I've not been able to intuit why and when a runtime is O(log n) or O(n log n).
Recurse Center Day 2: Pairing Is Great
Today was the first "regular day" of RC, wherein the schedule was structured as it will be for the remainder of the batch. I started the day with two goals:
See all tags.