- Published on
Binary Search
- Authors
- Name
- ShoxruxC
- @iOSdasturchi
๐ Vazifa tavsifi
Tartiblangan N ta elementli massiv va K berilgan. Binary search algoritmi bilan K ni toping (indeksni qaytaring).
Misol:
Input: N=7, K=5, arr=[1,2,3,5,7,9,11]
Output: 3
Binary Search
Qiyin12 daqiqa15 ball
๐ Misollar
Kiruvchi: N=7, K=5, arr=[1,2,3,5,7,9,11]
Chiquvchi: 3
Kiruvchi: N=5, K=10, arr=[2,5,8,10,15]
Chiquvchi: 3
func binarySearch(_ N: Int, _ K: Int, _ arr: [Int]) -> Int {
// Kodingizni shu yerga yozing
}
Run tugmasini bosing