add a fast-path for size == 1 arrays in sort

radix sort implementation asserts that array must be of size > 1

Author: ndgrigorian

dpctl/tensor/_sorting.py

@@ -85,6 +85,8 @@ def sort(x, /, *, axis=-1, descending=False, stable=True, kind=None):
         return dpt.copy(x, order="C")
     else:
         axis = normalize_axis_index(axis, ndim=nd, msg_prefix="axis")
+    if x.size == 1:
+        return dpt.copy(x, order="C")
     a1 = axis + 1
     if a1 == nd:
         perm = list(range(nd))
@@ -96,15 +98,6 @@ def sort(x, /, *, axis=-1, descending=False, stable=True, kind=None):
         arr = dpt.permute_dims(x, perm)
     if kind is None:
         kind = "stable"
-    if not isinstance(kind, str) or kind not in [
-        "stable",
-        "radixsort",
-        "mergesort",
-    ]:
-        raise ValueError(
-            "Unsupported kind value. Expected 'stable', 'mergesort', "
-            f"or 'radixsort', but got '{kind}'"
-        )
     if kind == "mergesort":
         impl_fn = _get_mergesort_impl_fn(descending)
     elif kind == "radixsort":