Categories
Data Structure and Algorithm Linear

Linear Search

The time complexity of the linear search algorithm isĀ O(n). This means that the running time increases at most linearly with the size of the input.

// Linear Search 
package main

import (
  "fmt"
)

// Linear Search function
func LinearSearch(elements []int, findElement int) bool {
  var element int
  for _, element = range elements {
    if element == findElement {
      return true
    }
  }
  return false
}
func main() {
  var elements []int
  elements = []int{15, 48, 26, 18, 41, 86, 29, 51, 20}
  fmt.Println(LinearSearch(elements, 48))
}