BinarySearch

BinarySearch.kt

class BinarySearch {
    companion object {
        @JvmStatic
        fun main(args: Array<String>) {
            println("Index position: " + binarySearch(mutableListOf(1,15,34,45,65,76,87), 76))
        }

        private fun binarySearch(list: List<Int>, itemToFind: Int): Int {
            //Starting point
            var left = 0
            //Ending point
            var right = list.size - 1
            //Iterate
            while (left < right) {
                //Find out the middle position
                val middle = left + (right - 1) / 2
                //Check if the current item is itemToFind, if yes return the index
                if (list[middle] == itemToFind) return middle
                //If middle index value is less than itemToFind, set left to middle+1
                if (list[middle] < itemToFind) {
                    left = middle + 1
                } else {
                    //Set right to middle -1
                    right = middle - 1
                }
            }
            return -1
        }
    }
}