Are you sure you're getting this? 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.
OUTPUT
Results will appear here.