We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Seems like the BinarySearch.cls does not support the edge case scenarios like the second element of a list of odd size, etc i.e. when left == right.
Ex: System.debug(BinarySearch.binarySearchIterative(new List{0,1,2,3,4,5,6,7,8,9,10},1)); fails and returns -1 even when 1 exists in the list.
Possible resolution: Handle the scenario by adding the following after while loop : if(left == right) return right; #2
if(left == right) return right;
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Seems like the BinarySearch.cls does not support the edge case scenarios like the second element of a list of odd size, etc i.e. when left == right.
Ex: System.debug(BinarySearch.binarySearchIterative(new List{0,1,2,3,4,5,6,7,8,9,10},1)); fails and returns -1 even when 1 exists in the list.
Possible resolution: Handle the scenario by adding the following after while loop :
if(left == right) return right;#2
The text was updated successfully, but these errors were encountered: