binary Search int - CSharp Data Structure Algorithm

CSharp examples for Data Structure Algorithm:Sort

  1. HOME
  2. CSharp
  3. Data Structure Algorithm
  4. Sort

Description

binary Search int

Demo Code


using System.Text;
using System.Linq;
using System.Collections.Generic;
using System;// w  ww. ja v  a2 s.  c  o  m

public class Main{
        public static int binarySearch(int st, Func<int, bool> func)
        {
            int ret = 0;
            subBinarySearch(0, st, out ret, func);
            return ret;
        }
        static void subBinarySearch(int begin, int end, out int idx, Func<int, bool> func)
        {
            if (begin == end || begin == end-1)
            {
                idx = end;
            }
            else
            {
                int mid = (begin + end) / 2;
                if (func(mid))
                {
                    subBinarySearch(mid, end, out idx, func);//tail optimas, of couse
                }
                else
                {
                    subBinarySearch(begin, mid, out idx, func);
                }
            }
        }
}

Related Tutorials