Is there any way to calculate k by any formula or the only way is to get it through the sorting sequence generation?
I can calculate the amount of steps (and the steps themselves) to sort any input with some fixed length, but obviuosly, there are some sequences of this length, that can be sorted by shorter sequence of steps and I cannot understand how to differ them in the input.