In the Python course material, like the Searching and Sorting Algorithms Review, there’s a claim that “The condition for binary search to work is that the items in the list must be in ascending order.“ And in the following quiz there’s a question on condition for binary search, options of items must be in ascending and descending order are both provided, but apparently only in ascending order is deemed correct. But I think binary search can also work for descendingly sorted list by reversing certain operations. Is it correct to say only a sorted list is needed, not in a particular order? Or there’s special reason to require an ascendingly sorted list?
you must know how they are sorted, as long as that is known any sorting would work technically
you can open an issue on github to point this out
Thank you for helping make FCC better. Bugs can be reported as GitHub Issues. Whenever reporting a bug, please check first that there isn’t already an issue for it and provide as much detail as possible.
Thanks. An issue has been opened there.