jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Faster binarySearch

Browse source
This commit is contained in:
data-man 2018-05-23 08:42:22 +03:00
commit 39a1ad650c
1 changed files with 6 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

6
lib/pure/algorithm.nim
View file

@ -86,6 +86,9 @@ proc binarySearch*[T, K](a: openArray[T], key: K,
var step = len shr 1 var step = len shr 1
while step > 0: while step > 0:
let i = result or step let i = result or step
if cmp(a[i], key) == 0:
return i
if cmp(a[i], key) < 1: if cmp(a[i], key) < 1:
result = i result = i
step = step shr 1 step = step shr 1
@ -94,6 +97,9 @@ proc binarySearch*[T, K](a: openArray[T], key: K,
var b = len var b = len
while result < b: while result < b:
var mid = (result + b) shr 1 var mid = (result + b) shr 1
if cmp(a[mid], key) == 0:
return mid
if cmp(a[mid], key) < 0: if cmp(a[mid], key) < 0:
result = mid + 1 result = mid + 1
else: else: