Created
August 24, 2019 11:54
-
-
Save midorikocak/094cb9587ead3c61bdbff2c0a6725302 to your computer and use it in GitHub Desktop.
Simple Binary Search Example
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function binarySearch(aranan, dizi) { | |
var ek = 0; | |
var eb = 9; | |
var bakilan = Math.floor((ek + eb) / 2); | |
var deneme = 1; | |
while (ek <= eb) { | |
logla(ek, eb, aranan, bakilan, deneme); | |
if (aranan == dizi[bakilan]) { | |
console.log("sayi bulundu"); | |
return; | |
} else if (aranan > dizi[bakilan]) { | |
ek = bakilan + 1; | |
} else if (aranan < dizi[bakilan]) { | |
eb = bakilan - 1; | |
} | |
bakilan = Math.floor((ek + eb) / 2); | |
deneme++; | |
} | |
console.log("sayi bulunamadı"); | |
return; | |
} | |
function logla(ek, eb, aranan, bakilan, deneme) { | |
console.log(deneme+'. denemede '+ek + "-" + eb + " aralığında " + aranan + " arandı."); | |
console.log(bakilan + "." + " elemana bakıldı."); | |
console.log(); | |
} | |
var dizi = [10, 19, 28, 41, 59, 67, 75, 80, 86, 94]; | |
binarySearch(75, dizi); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment