I would say this is a limitation, not a Bug.
The C/C++ replacement line
> mid = ((unsigned) (low + high)) >> 1;
is not able fix this bug, the limitation (number of elements in the binary tree) is just doubled, not sufficient if array index is an unsigned int.
A
> mid = ((size_t) low + (size_t) high) >> 1;
would be needed then here.
Even more interesting:
Bserach only works with unique key values, else its not garantueed to return the first entry of the search value (qsort has no prob with multiple keys)
Matthias, of course, it's not a bug in the binary search algorithm, it's a limitation of the runtime environment the binary search algorithm is running in.
I would say this is a limitation, not a Bug.
The C/C++ replacement line
> mid = ((unsigned) (low + high)) >> 1;
is not able fix this bug, the limitation (number of elements in the binary tree) is just doubled, not sufficient if array index is an unsigned int.
A
> mid = ((size_t) low + (size_t) high) >> 1;
would be needed then here.
Even more interesting:
Bserach only works with unique key values, else its not garantueed to return the first entry of the search value (qsort has no prob with multiple keys)
Matthias, of course, it's not a bug in the binary search algorithm, it's a limitation of the runtime environment the binary search algorithm is running in.