Is there any good use for this? Like a sorting algorithm?
This block slices a list in half through the points provided. Note that the number with the index you're slicing through will be in the second half. For example, slicing {1,2,3,4,5,6,7,8,9,10} through index 5 returns {{1,2,3,4},{5,6,7,8,9,10}}. Also, you can slice through multiple points! For example, slicing {1,2,3,4,5,6,7,8,9,10} through points 5 and 7 will return {{1,2,3,4},{5,6},{7,8,9,10}}.
The use that leaps to mind is mergesort, for which you want to split a list in half. Although when I write (recursive, functional) mergesort, since it's not important to preserve the original list order, I use
I wonder if it wouldn't be faster if you implemented it using hyperized ITEM:
That's for cutting in half, but you could use your POS input instead of length/2.