using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Binary_search
{ class Program
{ static void Main(string[] args)
{ int[] array = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; Console.WriteLine("This is your array"); foreach (var item in array)
{ Console.Write(item.ToString() + ' ');
}
Console.WriteLine(""); Console.WriteLine("Enter the element to search and press enter"); int element = int.Parse(Console.ReadLine());
binary_search(array, element);
Console.ReadLine();
}
static void binary_search(int[] array, int element)
{ int average = 0;
int max = array.Length - 1;
int min = 0;
bool is_in_array = false;
while (min <= max)
{ average = (max + min) / 2;
if (array[average] == element)
{ is_in_array = true;
break;
}
else if (array[average] > element)
{ max = average - 1;
}
else
min = average + 1;
}
if (is_in_array)
{ Console.WriteLine("The element is in position: " + (average + 1)); }
else
{ Console.WriteLine("The element was not found"); }
}
}
}
Crear cuenta
Comentarios sobre la versión: 20181230 (0)
No hay comentarios