CS61B Guide
Search…
Asymptotics Practice
Make sure to review Asymptotic Analysis Basics before proceeding with these problems.

# Introduction

Asymptotics is a very intuition-based concept that often doesn't have a set algorithm for computing. The best way to get good at analyzing programs is to practice!
With that said, here are some problems of increasing difficulty for you to enjoy 😊
For all of the below problems, assume that all undefined functions have a constant O(1) complexity.

# Loops

Question 1
What runtime does this function have?
1
void throwHalfOfMyItems(int n) {
2
for (int i = 0; i < n; i += 1) {
3
if (i % 2 == 0)
4
throwItem(n);
5
}
6
}
Copied!
$\Theta(n)$
Explanation: The method throwItem() runs n/2 times. Using the simplification rules, we can extract the constant 1/2 to simply get n.
Keep the change, ya filthy animal.
Question 2a
What runtime does this function have?
1
void lootShulkerBoxes(int n) {
2
for (int box = n; box > 0; box -= 1) {
3
for (int stack = 0; stack < n; stack += 1) {
4
for (int i = 0; i < 64; i += 1) {
5
lootItem(i * stack * box);
6
}
7
}
8
}
9
}
Copied!
$\Theta(n^2)$
Explanation: There are three nested loops in this problem. Whenever there are nested loops whose runtimes are independent of each other, we need to multiply the runtimes in each loop. So, we get:
$\Theta(n * n * 64)$
which simplifies into n^2
That's a lot of items to loot...
Question 2b
I've tweaked the previous problem a little 😁 Try to spot the difference and see if it changes the runtime at all!
1
void lootShulkerBoxes(int n, int stacksToLoot) {
2
for (int box = n; box > 0; box -= 1) {
3
for (int stack = stacksToLoot; stack > 0; stack -= 1) {
4
for (int i = 0; i < 64; i += 1) {
5
lootItem(i * stack * box);
6
}
7
}
8
}
9
}
Copied!
$\Theta(n)$
Explanation: Even though stacksToLoot is a user input, we're only concerned about finding the runtime for n so stacksToLoot can be treated like a constant! Therefore, we now have
$\Theta(n * s* 64)$
where s = stacksToLoot which simplifies into n.
ok now this is getting a bit overboard

# Recursion

The following two problems are inspired by this worksheet.
Question 3
TREEEEEEEEE recursion 🌳🌲🌴
1
void plantJungleSaplings(int n) {
2
if (n > 0) {
3
for (int i = 0; i < 4; i += 1) {
4
plantJungleSaplings(n - 1);
5
}
6
}
7
}
Copied!
$\Theta(4^n)$
Explanation: This tree recursion creates a tree with n layers. Each layer you go down, the number of calls multiplies by 4!
Tree diagram for method calls.
This means that the number of calls in total will look like this:
$\sum_{i=1}^{n}4^i$
And if you remember your power series, you'll know that this sum is equal to
$4^{n+1}-1$
which simplifies into the final answer.
an image that makes you long for TreeCapacitator
Question 4
Let's replace the 4 in the previous problem with n and see what insanity ensues.
1
void plantCrazySaplings(int n) {
2
if (n > 0) {
3
for (int i = 0; i < n; i += 1) { // This line changed
4
plantCrazySaplings(n - 1);
5
}
6
}
7
}
Copied!
$\Theta(n!)$
Explanation: This tree recursion creates a tree with n layers. Each layer you go down, the number of calls multiplies by n-1...
What a mess (!)
This means that the number of calls in total will look like this:
$\sum_{i=1}^{n} \frac{n!}{i!}$
Since n! is not dependent on i it can be factored out of the sum to produce this:
$n!\sum_{i=1}^{n} \frac{1}{i!}$
Hey, that looks a lot like the Taylor series for
$e$
! Since e is a constant, it simply reduces to n!.

# Best and Worst Case Runtimes

Question 5
Here's a case where the best case and worst case runtimes are different. Can you figure out what they are? (Let n = items.length).
1
Item[] hopperSort(Item[] items) {
2
int n = arr.length;
3
for (int i = 1; i < n; ++i) {
4
int key = items[i];
5
int j = i - 1;
6
while (j >= 0 && items[j].compareTo(key) > 0) {
7
items[j + 1] = items[j];
8
j = j - 1;
9
}
10
items[j + 1] = key;
11
}
12
}
Copied!
Best Case:
$\Theta(n)$
if the array is nearly sorted except for a couple values. In this case, the while loop will only run a small number of times, so the only loop left is the for loop.
Worst Case:
$\Theta(n^2)$
if the array is totally reversed. This will cause the while loop to run on the order of O(n) times, resulting in a nested loop.
Note: HopperSort is literally just Insertion Sort 😎🤣
hoppers rate 64/64
Question 6
Here's a mutual recursion problem! What are the best and worst cases for explodeTNT(n)? What are their runtimes?
1
void explodeTNT(int n) {
2
if (n % 2 == 0) {
3
digDirts(n - 1, true);
4
digDirts(n - 2, false);
5
} else {
6
digDirts(n / 2, true);
7
}
8
}
9
10
void digDirts(int n, boolean isTNT) {
11
if (isTNT) {
12
explodeTNT(n / 2);
13
}
14
removeDirt(); // not implemented, assume O(1) runtime
15
}
Copied!
Best Case:
$\Theta(\log(n))$
if n is even. This will result in n being halved every function call.
Worst Case:
$\Theta(n)$
if n is odd. See the tree below for an illustration of what happens in this case- hopefully the diagram will make it clearer as to why it's O(n).
A diagram of what happens in the worst and best cases.
don't play with tnt, kids

# Challenge Problems

These problems are quite difficult. Don't be concerned if you don't feel confident in solving them (I certainly don't).
Question 7
A huge disaster :ooo
1
//initially start is 0, end is arr.length.
2
public int PNH(char[] arr, int start, int end) {
3
if (end <= start) {
4
return 1;
5
}
6
int counter = 0;
7
int result = 0;
8
for (int i = start; i < end; i += 1) {
9
if (arr[i] == 'a') {
10
counter += 1;
11
}
12
}
13
for (int i = 0; i < counter; i += 1) {
14
result += PNH(arr, start + 1, end);
15
}
16
int mid = start + (end - start) / 2;
17
return PNH(arr, start, mid) + PNH(arr, mid + 1, end);
18
}
Copied!
Best Case:
$\Theta(n\log(n))$
If none of the characters in char[] is 'a', then each call to PNH does
$\Theta(n)$
work. Total work per layer is always N, with logN layers total.
Worst Case:
$\Theta(n!)$
All of characters in char[] is 'a'. In this case, the for loop recursive calls will dominate the runtime, because it'll be the main part of the recursive tree. The interval start to end is decreased by one in the for loop recursive calls, while that interval is halved in the return statement recursive calls. This means the return statement recursive calls will reach the base case in logn levels, while the recursive calls in the for loop will take n levels. Thus, we can proceed with the same analysis as question 4.
Question 8
Congrats for making it this far! By now you should be an expert in asymptotic analysis :P Here's one last problem:
1
//initially start is 0, end is arr.length.
2
public int lastOne(char[] arr, int start, int end) {
3
if (end <= start) {
4
return 1;
5
}
6
else if (arr[start] <= arr[end]) {
7
return lastOne(arr, start + 1, end - 1);
8
} else {
9
int temp = arr[start];
10
arr[start] = arr[end];
11
arr[end] = temp;
12
13
return lastOne(arr, start + 1, end)
14
+ lastOne(arr, start, end - 1)
15
+ lastOne(arr, start + 1, end - 1);
16
}
17
}
Copied!
Best Case:
$\Theta(n)$
if the else if case is always true. This will produce a tree with height n/2, where each height does constant work.
Worst Case:
$\Theta(3^n)$
if else if case is never true. Sorry no diagram yet :((