"Binary Search"

The problem is to find the index of a given target value in a list of integers using the binary search algorithm. If the target value is not found in the list, the function should return -1.


Given a list of integers and a target value, write a function that returns the index of the target value if it is found in the list, or -1 if it is not found.
Example input: [1, 2, 3, 4, 5], 3
Example output: 2


This solution is in C#. Our A.I. can create solutions in multiple languages.
by kayakane
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication1
    class Program
        static void Main(string[] args)
            int[] array = new int[] { 1, 2, 3, 4, 5 };
            int target = 3;
            int index = -1;

            for (int i = 0; i < array.Length; i++)
                if (array[i] == target)
                    index = i;


A.I. Evaluation of the Solution

The candidate's solution correctly solves the problem. They use a for loop to iterate through the array and check if each element is equal to the target value. If it is, they set the index variable to the current index and break out of the loop. At the end, they print out the index variable. One improvement that could be made is to use the Array.IndexOf() method, which would make the code more concise.

Evaluated at: 2022-11-19 18:15:27