sorts: make odd_even_sort generic over any comparable type (Part of #15234)

Adds a Comparable-bound TypeVar (matching the pattern used in insertion_sort.py), doctests covering strings, floats, and the non-comparable TypeError case, and registers odd_even_sort in the shared test_sort_rejects_non_comparable_items test.

Part of #15234

Author: aayushgupta7725

sorts/odd_even_sort.py

@@ -4,8 +4,15 @@
 https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort
 """
 
+from collections.abc import MutableSequence
+from typing import Any, Protocol, TypeVar
 
-def odd_even_sort(input_list: list) -> list:
+class Comparable(Protocol):
+    def __lt__(self, other:Any, /)->bool: ...
+
+T = TypeVar("T", bound="Comparable")
+
+def odd_even_sort[T:Comparable](collection: MutableSequence[T]) -> MutableSequence[T]:
     """
     Sort input with odd even sort.
 
@@ -24,22 +31,30 @@ def odd_even_sort(input_list: list) -> list:
     [-10, -1, 2, 10]
     >>> odd_even_sort([1 ,2 ,3 ,4])
     [1, 2, 3, 4]
+    >>> odd_even_sort(["c","a","b"])
+    ['a', 'b', 'c']
+    >>> odd_even_sort([2.5, -1, 0.0])
+    [-1, 0.0, 2.5]
+    >>> odd_even_sort([1,"a"])
+    Traceback (most recent call last):
+       ...
+    TypeError: '>' not supported between instances of 'int' and 'str'
     """
     is_sorted = False
     while is_sorted is False:  # Until all the indices are traversed keep looping
         is_sorted = True
-        for i in range(0, len(input_list) - 1, 2):  # iterating over all even indices
-            if input_list[i] > input_list[i + 1]:
-                input_list[i], input_list[i + 1] = input_list[i + 1], input_list[i]
+        for i in range(0, len(collection) - 1, 2):  # iterating over all even indices
+            if collection[i] > collection[i + 1]:
+                collection[i], collection[i + 1] = collection[i + 1], collection[i]
                 # swapping if elements not in order
                 is_sorted = False
 
-        for i in range(1, len(input_list) - 1, 2):  # iterating over all odd indices
-            if input_list[i] > input_list[i + 1]:
-                input_list[i], input_list[i + 1] = input_list[i + 1], input_list[i]
+        for i in range(1, len(collection) - 1, 2):  # iterating over all odd indices
+            if collection[i] > collection[i + 1]:
+                collection[i], collection[i + 1] = collection[i + 1], collection[i]
                 # swapping if elements not in order
                 is_sorted = False
-    return input_list
+    return collection
 
 
 if __name__ == "__main__":

tests/test_sorts.py

@@ -121,6 +121,7 @@ def test_sort_matches_builtin(sort, case) -> None:
         gnome_sort,
         insertion_sort,
         merge_sort,
+        odd_even_sort,
         selection_sort,
     ],
     ids=lambda f: f.__name__,