binary searching using recursion function
Binary searching using Recursion method using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace search_a_number_in_an_aray { class Program { public static void Main(string[] args) { int[] num = new int[] { 2, 6, 11, 8,66, 3,45,46,78,77 }; int found, searchItem; int first = 0, last = num.Length-1; // sort function bubblesort(num); //Output function output(num); Console.WriteLine(); // input the search item Console.WriteLine("Enter the number :"); searchItem = int.Parse(Console.ReadLine()); // search function found = search(num, searchItem,first,last); // If found if (found == -1) { Console.WriteLine("Element is not present"); } Console.WriteLine("The number {0...
