0 votes 0 votes Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect? Algorithms ace-test-series algorithms time-complexity + – Neelu Lalchandani asked Nov 2, 2022 • retagged Nov 2, 2022 by makhdoom ghaya Neelu Lalchandani 365 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply DebRC commented Nov 7, 2022 reply Follow Share Yes, C should be correct. It would have been incorrect if they mentioned the tightest upper bound. 2 votes 2 votes Neelu Lalchandani commented Nov 8, 2022 reply Follow Share Thankyou 1 votes 1 votes Please log in or register to add a comment.
