Silinebilir

fun searchInsert(nums: MutableList<Int>, target: Int): Int {
    if (nums.contains(target)) { // if the target is found
        return nums.indexOf(target)  // return the index
    } else {
        val tmpNums = nums
        tmpNums.add(target) // it would be if it were inserted in order
        tmpNums.sort().apply {
            return tmpNums.indexOf(target) // return the index
        }
    }
}

  
 int i = 0; 
 while(i < arraySize) { 
 	if(nums[i]  > target || nums[i] == target) { 
 		break; 
 	}  
 	++i; 
 } 
 return i;