C# example- binary search algorithm

Binary search algorithm

This is C# example code for a binary search algorithm. If your are not sure about the process of binary search, i recommend you to read this tutorial:

Algorithm and Data Structure tutorial  

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;

namespace ConsoleApplication1
{
class Program
{

static void Main(string[] args)
{
  int[] arr= new int[5]{23,2,3,34,6}; //unsorted data set
  int pos;
  pos=binsearch(arr,23,5);
  if(pos!=-1)
   Console.WriteLine("The target item was found at location:{0}",pos);
  else
   Console.WriteLine("The target item was not found in the list.\n");
  Console.ReadLine();

}

///binary search
static int binsearch(int[] dataset,int target, int n){
  insertsort(dataset,n);//make sure the list sorted
  int i;
  int pos=-1;
  int found=0;

  if(target<dataset[n/2]){//look in the first half
    for(i=0;i<n/2 && found!=1;i++)
       if(target==dataset[i]){ found=1;pos=i;}
     }
  else{ //look in the second haft
    for(i=n/2;i<n && found!=1;i++)
       if(target==dataset[i]){ found=1;pos=i;}
  }


return pos;
}

static void insertsort(int[] dataset, int n)
{

  int i, j;
  for (i = 1; i < n; i++)
   {
     int pick_item = dataset[i];
     int inserted = 0;
     for (j = i - 1; j >= 0 && inserted != 1; )
       {
          if (pick_item < dataset[j])
           {
             dataset[j + 1] = dataset[j];
             j--;
             dataset[j + 1] = pick_item;
                 }
         else inserted = 1;
              }
        }

     }
   }
}