CSHARP

linear search c#

static int LineSearch(int[] numbers, int num)
        {
            for (int i = 0; i < numbers.Length; i++)
            {
                if (numbers[i] == num)
                {
                    return i;
                }
            }
            return -1;
        }

linear search algorithm c#

static int LineSearch(int[] n,int num) {
        for(int i = 0; i < n.Length; i++)
            if(n[i] == num) return i;
        return -1;
    }

linear search c#

Int index = Array.IndexOf(amountOfArrays,guess);
If (index == -1)
{
    // not found
}
else 
{
    // found
}