Question

How to implement the binary search algorithm in C#

Answer 1

using System;

class Program
{
    static int binarySearch(int[] array, int element, int low, int high) {
        while (low <= high) {
            int mid = low + (high - low) / 2;

            if (array[mid] == element)
                return mid;

            if (array[mid] < element)
                low = mid + 1;
            else
                high = mid - 1;
        }
    
        return -1;
    }
    static void Main() {
        int[] array = {3, 4, 6, 8, 9, 10, 12, 20, 27, 30, 31};
        int number_to_find = 9;

        int index = binarySearch(array, number_to_find, 0, array.Length);
        
        if (index == -1) 
            Console.WriteLine("Not found");
        else
            Console.WriteLine("Found at index: " + index);
    }
}





/*
run:

Found at index: 4

*/

 

70+ SQL courses for beginners and professionals