Linear Search in F#

Published on 08 April 2026 (Updated: 08 April 2026)

Welcome to the Linear Search in F# page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

open System

module LinearSearch =
    let run (numbers: 'a list, target: 'a) =
        numbers
        |> List.exists ((=) target)
        |> Ok


module Helpers =
    let usage =
        "Usage: please provide a list of integers (\"1, 4, 5, 11, 12\") and the integer to find (\"11\")"

    let private (|Int|_|) (s: string) =
        match s.Trim() |> Int32.TryParse with
        | true, n -> Some n
        | _ -> None

    let private (|IntList|_|) (s: string) =
        s.Split(',', StringSplitOptions.RemoveEmptyEntries)
        |> Array.toList
        |> List.choose (fun x ->
            match x.Trim() with
            | Int n -> Some n
            | _ -> None)
        |> function
            | [] -> None
            | xs -> Some xs


    let parseArgs argv =
        match argv with
        | [| IntList numbers; Int target |] -> Ok(numbers, target)
        | _ -> Error usage

    let handleResult =
        function
        | Ok result ->
            printfn "%b" result
            0
        | Error msg ->
            eprintfn "%s" msg
            1

[<EntryPoint>]
let main argv =
    argv
    |> Helpers.parseArgs
    |> Result.bind LinearSearch.run
    |> Helpers.handleResult

Linear Search in F# was written by:

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.