fix(searches): empty jump_search input; validate cyclic_sort

searches/jump_search.py

@@ -33,9 +33,14 @@ def jump_search[T: Comparable](arr: Sequence[T], item: T) -> int:
     10
     >>> jump_search(["aa", "bb", "cc", "dd", "ee", "ff"], "ee")
     4
+    >>> jump_search([], 5)
+    -1
     """
 
     arr_size = len(arr)
+    if arr_size == 0:
+        return -1
+
     block_size = int(math.sqrt(arr_size))
 
     prev = 0

sorts/cyclic_sort.py

@@ -27,8 +27,30 @@ def cyclic_sort(nums: list[int]) -> list[int]:
     []
     >>> cyclic_sort([3, 5, 2, 1, 4])
     [1, 2, 3, 4, 5]
+    >>> cyclic_sort([7, 3, 2, 3, 54, 5, 4])  # doctest: +IGNORE_EXCEPTION_DETAIL
+    Traceback (most recent call last):
+        ...
+    ValueError: All numbers must be unique, got [7, 3, 2, 3, 54, 5, 4]
+    >>> cyclic_sort([1, 2, 5])  # doctest: +IGNORE_EXCEPTION_DETAIL
+    Traceback (most recent call last):
+        ...
+    ValueError: All numbers must be in range 1 to 3, got 5
     """
 
+    length = len(nums)
+    if length == 0:
+        return nums
+
+    seen: set[int] = set()
+    for num in nums:
+        if num < 1 or num > length:
+            msg = f"All numbers must be in range 1 to {length}, got {num}"
+            raise ValueError(msg)
+        if num in seen:
+            msg = f"All numbers must be unique, got {nums}"
+            raise ValueError(msg)
+        seen.add(num)
+
     # Perform cyclic sort
     index = 0
     while index < len(nums):