Binary Search using Swift - iOS Coding Challenge
Let's Code //: Playground - noun: a place where people can play import UIKit import Foundation var array : [ Int ] = [ 1 , 4 , 2 , 3 , 5 , 6 , 76 , 32 , 43 , 12 , 55 , 88 , 99 , 49 , 76 , 78 , 90 , 11 , 99 ] let key = 55 func binarySearch(array : [ Int ] , key : Int ) -> Bool { let minIndex = 0 let maxIndex = array. count - 1 let midIndex = maxIndex / 2 let midValue = array[midIndex] if (key < array[minIndex] || key > array[maxIndex]){ return false } if key < midValue { let arraySlice = Array (array[ 0 ...midIndex - 1 ]) return binarySearch (array: arraySlice, key: key) } if key > midValue { let arraySlice = Array (array[midIndex + 1 ...maxIndex]) ...