DSA

Check if array is sorted

Arrays. Time O(n), Space O(1).

August 8, 2026

DSA Arrays LeetCode Practice Sorting

Given an array nums of n integers, return true if the array nums is sorted in non-decreasing order or else false.

cpp

class Solution{	
	public:
		bool isSorted(vector<int>& nums){
			for(int i=1;i<nums.size();i++){
				if(nums[i-1] > nums[i])
					return false;
			}
			return true;
		}
};

Time Complexity: O(n)

Space Complexity: O(1)

Related articles

DSAMerge Two Sorted ArraysCovers: Extra Space (Naive), Two Pointers from End (Optim…, Gap Method (Shell Sort idea). Optimal — Space O(m + n).DSAMerge two sorted arrays without extra spaceOptimal approach. Optimal — Time O(n), Space O(1).DSARemove duplicates from sorted arrayCovers: Brute Force, Two Pointer. Optimal — Time O(n), Space O(1).