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
How to slice elements in Golang?
Program in Golang to print Pyramid of Numbers
How to add items to Slice using append function in Golang?
How to create Slice of Struct in Golang?
Golang program for implementation of Radix Sort
Golang program for implementation of Huffman Coding Algorithm
Program to print full pyramid using star
How do you handle HTTP timeouts with an HTTP client in Go?
React JS Count number of checkboxes are checked
Empty Interface Type in Go Programming Language