using System;

public class Program

{

    public static void Main()

    {

        int[] dataArray = new int[10] {76,44,65,22,87,88,33,44,25,70};

        int temp = 0;

        Console.WriteLine("Unsorted");

        for (int index = 0; index < dataArray.Length; index++)

        {

            Console.Write(" "+dataArray[index]);

        }//display array

        for ( int count =1; count < dataArray.Length; count++)

        {

            for ( int index = 0; index < dataArray.Length-1; index++)

            {  

        if (dataArray[index] > dataArray[index + 1])

        {

      temp = dataArray[index];

    dataArray[index] = dataArray[index + 1];

      dataArray[index + 1] = temp;

          }//end if for swopping in inner loop

            }//end inner loop

        }//end  outer loop

        //display sorted

        Console.WriteLine("  \nsorted");

        for (int index = 0; index < dataArray.Length; index++)

        {

            Console.Write(" "+dataArray[index]);

        }//end display loop and bubble sort

      //Binary search

        int foundIndex = -1;

        int middle;

        int lowIndex = 0;

        int highIndex = dataArray.Length-1;

        Console.Write("\nEnter search Value : ");

        int searchValue = Convert.ToInt32(Console.ReadLine());

        middle = (lowIndex + highIndex )/ 2;

        while ( lowIndex < highIndex && foundIndex == -1)

   {

            if ( searchValue == dataArray[middle])

            {

                foundIndex = middle; //position 

            }

          else if ( searchValue > dataArray[middle])

          {

            lowIndex = middle + 1;

          }

           else

           {

            highIndex = middle - 1;

           } //end if

    }//end while

        if ( foundIndex !=  -1)

        Console.WriteLine("{0} found at position {1}",searchValue,foundIndex );

        else

        Console.WriteLine("{0} not found",searchValue );    

  }

}