DSA
Linear Search
Arrays. Time O(n), Space O(1).
PatternSingle Pass ScanOptimalO(n) time · O(1) space
Given an array of integers nums and an integer target, find the smallest index (0 based indexing) where the target appears in the array. If the target is not found in the array, return -1
cpp
class Solution {
public:
int linearSearch(vector<int>& nums, int target) {
for(int i=0;i<nums.size();i++){
if(nums[i]==target)
return i;
}
return -1;
}
};
Time Complexity: O(n)
Space Complexity: O(1)