fixing case when input array is too small

Author: AlexanderKalistratov

dpnp/backend/extensions/statistics/kth_element1d.cpp

@@ -278,11 +278,17 @@ struct KthElementF
     {
         uint32_t items_to_sort = 127;
         uint32_t limit = 4 * (items_to_sort + 1);
-        uint32_t iterations =
-            std::ceil(-std::log(double(state.n) / limit) / std::log(0.536)) + 1;
-        // Ensure iterations are odd so the final result is always stored in
-        // 'partitioned'
-        iterations += 1 - iterations % 2;
+
+        uint32_t iterations = 1;
+
+        if (state.n > limit) {
+            iterations = std::ceil(
+                -std::log(double(state.n) / limit) / std::log(0.536)) + 1;
+
+            // Ensure iterations are odd so the final result is always stored in
+            // 'partitioned'
+            iterations += 1 - iterations % 2;
+        }
 
         auto prev = run_pick_pivot(exec_q, const_cast<T *>(in), partitioned, k,
                                    state, items_to_sort, limit, depends);

dpnp/dpnp_utils/dpnp_utils_statistics.py

@@ -194,7 +194,6 @@ def dpnp_cov(
 
 
 def native_median(a):
-
     partitioned = dpnp.empty_like(a)
     a_usm = dpnp.get_usm_ndarray(a)
     partitioned_usm = dpnp.get_usm_ndarray(partitioned)