C# (CSharp) Algorithm.Search.BinarySearch Beispiele

Beispiel #1

        public void BinarySearch_Test_Match_Found()
        {
            int[] input = Prime.PrimeNumber(100).ToArray();

            int itemToBeSearched = 11;

            Algorithm.Search.BinarySearch search = new Algorithm.Search.BinarySearch(input);

            int expectedIndex = 4;

            int actualIndex = search.Search(itemToBeSearched);

            Assert.AreEqual(expectedIndex, actualIndex);
        }

Beispiel #2

        public void BinarySearch_Test_No_Match()
        {
            int[] input = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };

            int itemToBeSearched = 11;

            Algorithm.Search.BinarySearch search = new Algorithm.Search.BinarySearch(input);

            int expectedIndex = -1;

            int actualIndex = search.Search(itemToBeSearched);

            Assert.AreEqual(expectedIndex, actualIndex);
        }