Implement Linear Search in Golang #200
Labels
Golang
good first issue
Good for newcomers
hacktoberfest
contribute to open source and win free tee! Hacktoberfest2020
Milestone
Algorithm/Data Structure: Linear Search
Programming Language: Golang
Difficulty: ⭐️⭐️
Issue Details
Description:
Implement the Linear Search algorithm in Golang. Linear Search is a simple searching algorithm that sequentially checks each element of a list until a match is found or the whole list has been searched. Your implementation should correctly search for a specified target element in a slice and return its index if found or -1 if not found.
Additional Information:
If you are new to Linear Search or need guidance on implementing it in Golang, feel free to ask questions or seek help in the comments. This is a great opportunity for contributors to gain experience in searching algorithms in Golang.
Note:
Before starting to work on this issue, please comment below to express your interest and let us know if you have any questions or need clarification on the task.
The text was updated successfully, but these errors were encountered: