Write a Haskell program to implement linear search

[harshraj8843]

Description

Write a Haskell program to implement linear search

Linear search is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.

Linear search is the simplest search algorithm. For this reason, it is often called sequential search.

Pseudocode

procedure linear_search (list, value)

   for each item in the list
      if match item == value
         return the item's location
      end if
   end for

end procedure

Example

list = [1,2,3,4,5]
value = 4

Output : 3

How to contribute

• Comment !assign to assign this issue to yourself
• Fork this repository
• Create a new branch
• Save the solution in program/program/implement-linear-search/implement_linear_search.hs
• Commit the changes
• Create a pull request

[codinasion-bot]

👋🏻 Hey @harshraj8843

💖 Thanks for opening this issue 💖

A team member should be by to give feedback soon.

[NeurantumData]

!assign