Binary search in a sorted array

Problem

Given a sorted array of integers and a target value, find the index of the target value in the array. If the target value is not found in the array, return -1.
Example input: [1, 2, 3, 4, 5], 3
Example output: 2

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.

kayakane

using System;

namespace InterviewPreperationGuide.Core.CrackingTheCodingInterview.c17q1 {
    public class Solution {
        public void Init () {
            Console.WriteLine ();
        }
    }
}