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

0% completed

Vote For New Content
Quiz
Quiz
Question 1

What is the time complexity of accessing an element by its index in an array?

O(1)
O(n)
O(log n)
O(n<sup>2</sup>)

.....

.....

.....

Like the course? Get enrolled and start learning!