Binary Search
123456789101112131415161718
fun binarySearch(arr: IntArray, target: Int) : Int? {
var firstIndex = 0
var lastIndex = arr.size - 1
while(firstIndex <= lastIndex) {
var midIndex = Math.floor((firstIndex + lastIndex) / 2.0).toInt()
if(arr[midIndex] == target) return midIndex
else if(arr[midIndex] < target) firstIndex = midIndex + 1
else lastIndex = midIndex - 1
}
return null
}
fun main(args : Array<String>){
val numbers = IntArray(100) {it}
if(binarySearch(numbers, 91) != null) println(binarySearch(numbers, 91))
else println("Element not found")
}
Kotlin
INFO