Binary Search in C#

Binary

Search in C#

Welcome to the Binary Search in C# 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.Collections.Generic;

if (args is not [var input, var targetRaw]
    || !int.TryParse(targetRaw, out int target)
    || !TryParseSorted(input.AsSpan(), out var numbers))
{
    return Usage();
}

Console.WriteLine(numbers.BinarySearch(target) >= 0);
return 0;

static bool TryParseSorted(ReadOnlySpan<char> span, out List<int> numbers)
{
    numbers = new(span.Count(',') + 1);

    int last = int.MinValue;

    while (!span.IsEmpty)
    {
        int comma = span.IndexOf(',');
        var token = comma >= 0 ? span[..comma] : span;

        span = comma >= 0 ? span[(comma + 1)..] : [];

        if (!int.TryParse(token, out int n) || n < last)
            return false;

        numbers.Add(n);
        last = n;
    }

    return numbers.Count > 0;
}

static int Usage()
{
    Console.Error.WriteLine(
        """Usage: please provide a list of sorted integers ("1, 4, 5, 11, 12") and the integer to find ("11")"""
    );

    return 1;
}

Binary Search in C# was written by:

• Jeremy Grifski
• Ștefan-Iulian Alecu

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.