public int binSearch(int[] data, int searchItem)
        {
            int index = 0;

            boolean ifPart = false;
            for(int i = 0; i < data.length; i++)
            {
                if (data[i] == searchItem)
                {
                    ifPart = true;
                }
            }
            if (!ifPart)
            {
                return -1;
            }

            if (data[data.length / 2] > searchItem)
            {
                int[] data1 = new int[data.length / 2];
                for(int i = 0; i < data.length / 2; i++)
                {
                    data1[i] = data[i];
                }
                index += binSearch(data1, searchItem);
            }

            else if (data[data.length / 2] < searchItem)
            {
                int[] data1 = new int[data.length / 2];
                for(int i = 0; i < data.length / 2; i++)
                {
                    data1[i] = data[i];
                }
                index += binSearch(data1, searchItem);
            }

            return data.length / 2;
        }