mirrors/Nim
1
0
Fork 0
mirror of https://github.com/nim-lang/Nim.git synced 2025-12-31 18:32:11 +00:00
Code Issues Packages Projects Releases Wiki Activity

binarySearch became even better

Browse Source
This commit is contained in:
data-man
2018-05-23 12:40:55 +03:00
parent df37796d88
commit a093605ab0
1 changed files with 10 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
lib/pure/algorithm.nim
View File

@@ -84,27 +84,31 @@ proc binarySearch*[T, K](a: openArray[T], key: K,
if (len and (len - 1)) == 0:
# when `len` is a power of 2, a faster shr can be used.
var step = len shr 1
var cmpRes: int
while step > 0:
let i = result or step
if cmp(a[i], key) == 0:
cmpRes = cmp(a[i], key)
if cmpRes == 0:
return i
if cmp(a[i], key) < 1:
if cmpRes < 1:
result = i
step = step shr 1
if cmp(a[result], key) != 0: result = -1
if cmpRes != 0: result = -1
else:
var b = len
var cmpRes: int
while result < b:
var mid = (result + b) shr 1
if cmp(a[mid], key) == 0:
cmpRes = cmp(a[mid], key)
if cmpRes == 0:
return mid
if cmp(a[mid], key) < 0:
if cmpRes < 0:
result = mid + 1
else:
b = mid
if result >= len or cmp(a[result], key) != 0: result = -1
if result >= len or cmpRes != 0: result = -1
proc binarySearch*[T](a: openArray[T], key: T): int =
## binary search for `key` in `a`. Returns -1 if not found.