binary search find minimum, C#

binary search find minimum

//Title of this code
//Rextester.Program.Main is the entry point for your code. Don't change it.

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

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            Assert(-1 == BinarySearch.FindMinimum(new int[]{3,4,6,7,-1,0}), "base case");
            Assert(-100 == BinarySearch.FindMinimum(new int[]{-100,2,3,4,6,7}), "sorted case");
        }
        
        public static void Assert(bool result, string message)
        {
            Console.WriteLine("ASSERT: {0}.  {1}", result ? "PASS" : "FAIL", message);
            
        }
        
        public static class BinarySearch
        {
            public static int FindMinimum(int[] nums)
            {
                int minimum = int.MaxValue;
                int left = 0, right = nums.Length - 1, mid;
                while(true)
                {
                    mid = left + (right - left) / 2;
                    if (nums[mid] > nums[right])
                    {
                        left = mid + 1;
                    }
                    else
                    {
                        if (nums[left] < nums[mid])
                        {
                            right = mid - 1;
                        }
                        else
                        {
                            minimum = nums[mid];
                            break;
                        }
                    }
                }
                Console.WriteLine("minimum = {0}", minimum);
                return minimum;
            }
        }
    }
}


run \| edit \| history \| help	0