Computer Sciences > Gate 2024 Set-1 > TCP IP
Given an integer array of size N, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm is
A
both Ο(𝑁) and Ω(𝑁)
B
Ο(𝑁) but not Ω(𝑁)
C
Ω(𝑁) but not Ο(𝑁)
D
neither Ο(𝑁) nor Ω(𝑁)

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science