1 mins read


Linear Search


Series: Search Algorithms

Episodes: (1/2)

Implementation

class LinearSearch<T> {
  private items: T[] = [];
 
  constructor(items: T[]) {
    this.items = items;
  }
 
  search(val: T): number {
    for (let i=0; i< this.items.length; i++) {
      if (this.items[i] === val) return i;
    }
    return -1;
  }
}