engineering recuitment GATE CSE 2023-24 Test Series Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Considering the equality \(\mathop \sum \limits_{j = 0}^n {j^2} = A\) and the following choices of A:
The equality above remains correct if A is replaced by
1
Ω(n2)
2
θ(n3)
3
θ (n4)
4
O(n4)