BINARY SEARCH WITH KOTLIN

BINARY SEARCH WITH KOTLIN, WITH ITERATIVE AND RECURSIVE APPROACH, WITH AN EXAMPLE SOLVING QUESTION 35 ON LEETCODE, Apologies as the screen recorder stops at 2 hours just before we solved the leetcode question, plz find the solution below, replace those segments in quotes with coding symbols in your IDE

class Solution {
fun searchInsert(nums: IntArray, target: Int): Int {

var answer:Int = 0

var targetPosition = binarySearchRecursive(nums.toList().sorted(), 0, nums.size-1, target)
answer = targetPosition

if(targetPosition== -1){

var modifiedList = nums.toMutableList()
modifiedList.add(target)

val newList =modifiedList.sorted()


answer = binarySearchRecursive(newList, 0, newList.size-1, target)
}

return answer



}




fun binarySearchRecursive(ourList:"INSERT INTEGER LIST TYPE HERE", startPosition: Int, endPosition: Int, searchedKey:Int):Int{

if (endPosition "INSERT GREATER THAN OR EQUAL TO SIGN IN YOUR IDE " startPosition){

var midPosition = startPosition + (endPosition-startPosition)/2

return if (ourList[midPosition] == searchedKey){

midPosition

}else if (ourList[midPosition] "INSERT GREATER THAN SIGN IN YOUR IDE" searchedKey){

binarySearchRecursive(ourList, startPosition, midPosition-1, searchedKey)

}else{

binarySearchRecursive(ourList, midPosition+1, endPosition, searchedKey)
}


}

return -1
}

}