SG
← Back

Linear Search

Scan each element until target found or end.

searcharraysUpdated 2025-09-01

Complexity

  • Time O(n)
  • Space O(1)

Example

  • int idx=-1; for(int i=0;i<a.length;i++){ if(a[i]==x){idx=i;break;} }