Grokking Algorithm Complexity and Big-O
Vote

0% completed

​

Quiz

Quiz

Question 1

What is the time complexity of the following recursive function?

public void printNumbers(int n) {
    if (n == 0) return;
    System.out.println(n);
    printNumbers(n - 1);
}
Click an option to answer

.....

.....

.....

Like the course? Get enrolled and start learning!

Reading Progress

0%

Vote for new content