Golang program for implementation of Linear Search
This technique pass over the list of elements, by using the index to move from the beginning of the list to the end. Each element is examined and if it does not match the search item, the next item is examined. By hopping from one item to its next, the list is passed over sequentially.
Example
package main
import "fmt"
func linearsearch(datalist []int, key int) bool {
for _, item := range datalist {
if item == key {
return true
}
}
return false
}
func main() {
items := []int{95,78,46,58,45,86,99,251,320}
fmt.Println(linearsearch(items,58))
}
Output
true
Most Helpful This Week
Golang Concurrency Best Practices
Go program to find SRV service record of a domain
How do you send an HTTP POST request with an HTTP client in Go?
Golang program for implementation of Pancake Sort
Go program to find PTR pointer record of a domain
How to append struct member dynamically using Empty Interface?