Computer Science - Algorithms - Big O notation - Name That Complexity

Students categorize code snippets into their Big O complexity. Categories: O(1), O(log n), O(n), O(n²), O(n log n). Items: 'return arr[0]' → O(1). 'for i in range(n): print(i)' → O(n). 'for i in range(n): for j in range(n): ...' → O(n²). 'while n>0: n//=2' → O(log n). 'sorted(arr)' → O(n log n). 'x