What math background do I need before starting a data structures course?
I'm planning to study CS 61B, a data structures course, using lecture videos. Before I begin, I'd like to know which math topics are actually used throughout the…
big O notation
What math background do I need before starting a data structures course?
I'm planning to study CS 61B, or a similar data structures course, through lecture videos and want to prepare efficiently. Which math topics actually come up during the…
Why do we usually give the tightest Big O bound?
If an algorithm runs in O(n), then O(n²), O(n³), and even O(n!) are technically valid upper bounds too. So when someone asks for an algorithm's Big O complexity,…
Why do we use the tightest Big O bound?
If an algorithm runs in O(n), then O(n²), O(n³), and even O(n!) are technically valid upper bounds too. So why do people expect the smallest or tightest bound…
Why does my Python solution time out when N is 2000 and U is 100000?
I'm confused about why this solution exceeds the two-second limit. The grid size is at most N = 2000, and there can be up to U = 100000…
How Can I Quickly Determine an Algorithm’s Time Complexity?
I have trouble understanding what an algorithm is doing just by reading its code, especially when trying to estimate its time complexity. Are there any reliable techniques or…
How Can I Quickly Figure Out an Algorithm’s Time Complexity?
I have trouble understanding what an algorithm is doing just by reading the code, especially when I need to estimate its time complexity. Are there any reliable shortcuts…
Is this function O(n) or O(1)?
I have a debate going on with my professor about the time complexity of a function I've written. The code is as follows: ```cpp int f(int m, int…
Understanding Time Complexity for Integer Comparisons
I'm curious about the time complexity involved in comparing two integers, a and b. Why is it generally considered to be O(1)? Additionally, could we apply the same…
Is an Algorithm with O(N^-1) Runtime Complexity Possible?
I'm curious if there's such a thing as an algorithm that has a runtime complexity of O(N^-1). If such an algorithm does exist, how would you go about…