C# SortableCollection.BinarySearch方法代码示例

        public void MethodShouldReturnFalseWhenItemDoesnotExists()
        {
            var collection = new SortableCollection<int>(new[] { 52, 111, 33, 33, 46, 1125, 1 });

            Assert.IsFalse(collection.BinarySearch(1111));
            Assert.IsFalse(collection.BinarySearch(-52));
            Assert.IsFalse(collection.BinarySearch(0));
        }

 public void TesBinarySearchtWithEmptyCollection()
 {
     SortableCollection<int> collection = new SortableCollection<int>();
     bool result = collection.BinarySearch(15);
     Assert.IsFalse(result);
     result = collection.BinarySearch(0);
     Assert.IsFalse(result);
     result = collection.BinarySearch(-1);
     Assert.IsFalse(result);
 }

 public void TestForSingleItem()
 {
     SortableCollection<string> collection = new SortableCollection<string>(
         new List<string>() { "1" });
     Assert.IsTrue(collection.LinearSearch("1"), "Linear search failed on single item collection");
     Assert.IsTrue(collection.BinarySearch("1"), "Binary search failed on single item collection");
     Assert.IsFalse(collection.LinearSearch("2"),
         "Linear search failed on single item collection - non-existing item");
     Assert.IsFalse(collection.BinarySearch("2"),
         "Binary search failed on single item collection - non-existing item");
 }

 public void TestForOddItems()
 {
     SortableCollection<string> collection = new SortableCollection<string>(
         new List<string>() { "5", "1", "4", "1", "6" });
     Assert.IsTrue(collection.LinearSearch("1"), "Linear search failed on odd items collection");
     collection.Sort(new SelectionSorter<string>());
     Assert.IsTrue(collection.BinarySearch("1"), "Binary search failed on odd items collection");
     Assert.IsFalse(collection.LinearSearch("2"),
         "Linear search failed on odd items collection - non-existing item");
     Assert.IsFalse(collection.BinarySearch("2"),
         "Binary search failed on odd items collection - non-existing item");
 }

        public void TesBinarySearchtWithOneMissingElement()
        {
            SortableCollection<int> collection = new SortableCollection<int>(
                new int[] { 3 });

            bool result = collection.BinarySearch(15);
            Assert.IsFalse(result);
            result = collection.BinarySearch(0);
            Assert.IsFalse(result);
            result = collection.BinarySearch(-1);
            Assert.IsFalse(result);
        }

        public void TesBinarySearchTrivialCase()
        {
            SortableCollection<int> collection = new SortableCollection<int>(
                new int[] { -33, -21, 0, 1, 2, 2, 4, 5, 6, 7, 12, 15 });

            bool result = collection.BinarySearch(2);
            Assert.IsTrue(result);
            result = collection.BinarySearch(4);
            Assert.IsTrue(result);
            result = collection.BinarySearch(5);
            Assert.IsTrue(result);
            result = collection.BinarySearch(6);
            Assert.IsTrue(result);
        }

        public void BinarySearchShouldWorkCorrectlyWithEmptyCollection()
        {
            var collection = new SortableCollection<int>();
            var found = collection.BinarySearch(21);

            Assert.IsFalse(found, "Element is found in empty collection!");
        }

        public void TestBinarySearchWithExistingRepeatingElementInCollection()
        {
            var collection = new SortableCollection<int>(new[] { 101, 101, 33, 22, 11, 0 });
            var result = collection.BinarySearch(101);

            Assert.IsTrue(result, "Element not found");
        }

        public void TestBinarySearchWithExistingElementInMiddlePositionOddCountOfElements()
        {
            var collection = new SortableCollection<int>(new[] { 49, 101, 33, 22, 11, 0, 17 });
            var result = collection.BinarySearch(22);

            Assert.IsTrue(result, "Element not found");
        }

        public void TestBinarySearchWithExistingElementInFirstPositionEvenCountOfElements()
        {
            var collection = new SortableCollection<int>(new[] { 49, 101, 33, 22, 11, 0 });
            var result = collection.BinarySearch(49);

            Assert.IsTrue(result, "Element not found");
        }

        public void TestBinarySearchWithEmptyCollection()
        {
            var collection = new SortableCollection<int>();
            var result = collection.BinarySearch(101);

            Assert.IsFalse(result, "Element found in empty collection");
        }

        public void TestBinarySearchWithCollectionOfEqualElements()
        {
            var collection = new SortableCollection<int>(new[] { 101, 101, 101, 101, 101 });
            var result = collection.BinarySearch(101);

            Assert.IsTrue(result, "Element not found");
        }

    static void Main()
    {
        var collection = new SortableCollection<int>(new[] { 22, 11, 101, 33, 0, 101 });
        Console.WriteLine("All items before sorting:");
        Console.WriteLine(collection);

        Console.WriteLine("SelectionSorter result:");
        collection.Sort(new SelectionSorter<int>());
        Console.WriteLine(collection);

        Console.WriteLine("Quicksorter result:");
        collection.Sort(new Quicksorter<int>());
        Console.WriteLine(collection);

        Console.WriteLine("MergeSorter result:");
        collection.Sort(new MergeSorter<int>());
        Console.WriteLine(collection);

        Console.WriteLine("Linear search 101:");
        Console.WriteLine(collection.LinearSearch(101));

        Console.WriteLine("Binary search 101:");
        Console.WriteLine(collection.BinarySearch(101));

        Console.WriteLine("Shuffle:");
        collection.Shuffle();
        Console.WriteLine(collection);

        Console.WriteLine("Shuffle again:");
        collection.Shuffle();
        Console.WriteLine(collection);
    }

        public static void Main()
        {
            List<int> numbers = new List<int>() {1,3,4,6,7,8,9,10,23,42};

            SortableCollection<int> sortableCollection = new SortableCollection<int>(numbers);
            Console.WriteLine(sortableCollection.BinarySearch(-12));
        }

        internal static void Main(string[] args)
        {
            var collection = new SortableCollection<int>(new[] { 22, 11, 101, 33, 0, 101 });
            Console.WriteLine("All items before sorting:");
            collection.PrintAllItemsOnConsole();

            Console.WriteLine("SelectionSorter result:");
            collection.Sort(new SelectionSorter<int>());
            collection.PrintAllItemsOnConsole();

            collection = new SortableCollection<int>(new[] { 22, 11, 101, 33, 0, 101 });
            Console.WriteLine("Quicksorter result:");
            collection.Sort(new QuickSorter<int>());
            collection.PrintAllItemsOnConsole();

            collection = new SortableCollection<int>(new[] { 22, 11, 101, 33, 0, 101 });
            Console.WriteLine("MergeSorter result:");
            collection.Sort(new MergeSorter<int>());
            collection.PrintAllItemsOnConsole();

            Console.WriteLine("Linear search 101:");
            Console.WriteLine(collection.LinearSearch(101) + Environment.NewLine);

            Console.WriteLine("Binary search 101:");
            Console.WriteLine(collection.BinarySearch(101) + Environment.NewLine);

            Console.WriteLine("Shuffle:");
            collection.Shuffle();
            collection.PrintAllItemsOnConsole();

            Console.WriteLine("Shuffle again:");
            collection.Shuffle();
            collection.PrintAllItemsOnConsole();
        }