Description

10 questions. Q1: O(3n² + 2n + 1) simplifies to? → O(n²). Q2: Code: for i in range(n): for j in range(n): if i==j: print(i). Complexity? → O(n²) (the if doesn't reduce iterations). Q3: Code: for i in range(n): j=1; while j<n: j*=2. Complexity? → O(n log n) (outer O(n), inner O(log n)). Q4: Which is

Details