How to find worst case time complexity of linear search algorithm

Data Structure solved GATE Question 2025..Repeated algorithm in GATE...find worst case time complexity of linear search algorithm of array sorting..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..