private static int bsearch(int[] sortedArray, int ourNumber)
        {
            int start = 0;
            int end = sortedArray.Length;
            int indexOfElement = -1;

            if (ourNumber <= sortedArray[end - 1])
                return indexOfElement;

            while (start < end)
            {
                int half = (end + start) / 2;
                if (sortedArray[half] == ourNumber)
                {
                    indexOfElement = half;
                    break;
                }
                if (sortedArray[half] > ourNumber)
                    start = half + 1;
                else
                    end = half - 1;
            }

            while (start < sortedArray.Length)
                if (sortedArray[start] < ourNumber)
                {
                    indexOfElement = start;
                    break;
                }
                else
                    start++;

            return indexOfElement;
        }