Assume that instance is an $$ elements array.

$$ Instance: $$ values and $1$ index $($A$,$ n$)$

$$ Divider: $1$ index $($i$)$

$$ Ordering maintain: $1$ index $($j$)$ and $1$ value$($val$)$

Totally needs $+1$ values and $3$ indices, so the space complexity is $()$