Binary search with recursion implemented in Kotlin

BinarySearch.kt

// The inputArray must be sorted in order to apply the binary search.
fun binarySearch(inputArray: Array<Int>, itemToSearch: Int) : Boolean {
    // This print is for see the interactions in the search
    println()
    inputArray.forEach {
        print("$it,")
    }

    if (inputArray.size > 1) {
        if (itemToSearch == inputArray[(inputArray.size / 2) - 1]) {
            return true
        }
        return if (itemToSearch > inputArray[(inputArray.size / 2) - 1]) {
            binarySearch(inputArray.copyOfRange(inputArray.size / 2, inputArray.size), itemToSearch)
        } else {
            binarySearch(inputArray.copyOfRange(0, inputArray.size / 2), itemToSearch)
        }
    }
    return false
}