Linear Search in Beef

Published on 03 February 2024 (Updated: 03 February 2024)

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

Current Solution

``````using System;
using System.Collections;

namespace LinearSearch;

class Program
{
public static void Usage()
{
Console.WriteLine(
"""
Usage: please provide a list of integers ("1, 4, 5, 11, 12") and the integer to find ("11")
"""
);
Environment.Exit(0);
}

public static Result<T> ParseInt<T>(StringView str)
where T : IParseable<T>
{
StringView trimmedStr = scope String(str);
trimmedStr.Trim();

// T.Parse ignores single quotes since they are treat as digit separators -- e.g. 1'000
if (trimmedStr.Contains('\''))
{
return .Err;
}

return T.Parse(trimmedStr);
}

public static Result<void> ParseIntList<T>(StringView str, List<T> arr)
where T: IParseable<T>
{
arr.Clear();
for (StringView item in str.Split(','))
{
switch (ParseInt<T>(item))
{
case .Ok(let val):
arr.Add(val);

case .Err:
return .Err;
}
}

return .Ok;
}

public static int LinearSearch<T>(List<T> arr, T target)
{
return arr.IndexOf(target);
}

public static int Main(String[] args)
{
if (args.Count < 2)
{
Usage();
}

List<int32> arr = scope .();
if (ParseIntList<int32>(args[0], arr) case .Err)
{
Usage();
}

int32 target = ?;
switch (ParseInt<int32>(args[1]))
{
case .Ok(out target):
case .Err:
Usage();
}

int index = LinearSearch<int32>(arr, target);
Console.WriteLine(index >= 0 ? "true" : "false");

return 0;
}
}

``````

Linear Search in Beef was written by:

• rzuckerm

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.