Improve sorted input validation in binary search (#14074)

* Improve sorted input validation in binary search

* Update binary_search.py

* Update binary_search.py

* Update binary_search.py

---------

Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
Co-authored-by: cclauss <3709715+cclauss@users.noreply.github.com>

Author: 3 people

searches/binary_search.py

@@ -10,9 +10,8 @@
 python3 binary_search.py
 """
 
-from __future__ import annotations
-
 import bisect
+from itertools import pairwise
 
 
 def bisect_left(
@@ -198,7 +197,7 @@ def binary_search(sorted_collection: list[int], item: int) -> int:
     >>> binary_search([0, 5, 7, 10, 15], 6)
     -1
     """
-    if list(sorted_collection) != sorted(sorted_collection):
+    if any(a > b for a, b in pairwise(sorted_collection)):
         raise ValueError("sorted_collection must be sorted in ascending order")
     left = 0
     right = len(sorted_collection) - 1