Nice

Wrong work of my code for array = {-4, 6, 8, 16},
target = 8,
x = 0;
Need little improvement to cover this corner case.

has been done

Either this fixed test case should be removed across all languages:

sect_sort([1, 2, 5, 7, 4, 6, 3, 9, 8], 8, 3)

Or the description should specify that the portion to sort may extend out of bounds, so solvers get a heads up in case their language doesn't silently handle out of range array operations.

The random tests make sure everything is always within range, so this fixed test is unnecessarily nonconforming. I really think it should be removed

it already is, the function name is used generically to make the notation easier

added

approved

Really enjoyed this kata — clever idea and a great way to practice recursive thinking. Thanks for creating such a fun brain-teaser!

Really enjoyed this one — compact problem, nice mathematical insight, and a smooth solution once the pattern clicks. Appreciate the kata!

Very nice kata to exercise with.

added

the issue is with your code. it doesnt account for all test cases.
an example like (!, False) would output false with your code logic. however the output should be true

nice kata

Thanks for the kata 🙏 neat exercise with rounding and absolute differences!

fixed