Let's test your knowledge. Is this statement true or false?
If an algorithm has a time complexity of O(n), it means that the algorithm will always have n nested loops.
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
Mark As Completed Discussion