Skip to content

Create binary and linear search haskell implementation #203

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
fanny wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create binary and linear search haskell implementation #203

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions Search/Haskell/binarySearch.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
binarySearch :: [Int] -> Int -> Int
binarySearch list element =
binarySearch' list 0 (size - 1) element
where size = length list

binarySearch' :: [Int] -> Int -> Int -> Int -> Int
binarySearch' list left right element
| right < left = -1
| (list !! middle) == element = middle
| (list !! middle) < element = binarySearch' list (middle + 1) right element
| otherwise = binarySearch' list left (middle - 1) element
where middle = (left + right) `div` 2
5 changes: 5 additions & 0 deletions Search/Haskell/linearSearch.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
linearSearch :: [Int] -> Int -> Int
linearSearch [] _ = -1
linearSearch (head: tail) element
| head == element = element
| otherwise = linearSearch tail element