Grokking Algorithm Complexity and Big-O
Ask Author
Back to course home

0% completed

Vote For New Content
Quiz
On this page
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);
}
A
O(1)
B
O(n)
C
O(n2)
D
O(log n)

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page