binary search

Question

Enter a Number which in the below array then arrange them rewrite it's array number

0	1	2	3	4	5
62	40	25	81	24	7

for example: if we choose a number as 25 it after arranging the arrays it rewrite the number of 25 array and print this arrays:

The array Number of 25 is 3

0	1	2	3	4	5
7	24	25	40	62	81

Vulpes · Answer

Try this: using System; class Program { static void Main() { int[] numbers = {62 40 25 81 24 7}; PrintArray(numbers); Array.Sort(numbers); int search; bool isValid; int index = - 1; while (true) { Console.Write(Please choose a number : ); isValid = int.TryParse(Console.ReadLine() out search); if (!isValid) { Console.WriteLine(Not a valid number); } else if ((index = BinarySearch(numbers search 0 5)) == -1) { Console.WriteLine(Not in the array); } else { break; } } Console.WriteLine(After sorting your number is at index {0} index); Console.WriteLine(); PrintArray(numbers); Console.ReadKey(); } static void PrintArray(int[] numbers) { Console.Write(Index ); for(int i = 0; i { Console.Write({0}  i); } Console.Write(
Number ); for(int i = 0; i { Console.Write({0-2}  numbers[i]); } Console.WriteLine(
); } static int BinarySearch(int[] numbers int search int min int max) { if (max int mid = (min + max)/2; if (numbers[mid] == search) { return mid; } else if(numbers[mid] > search) { return BinarySearch(numbers search min mid - 1); } else { return BinarySearch(numbers search mid + 1 max); } } }