Unsorted Sorting

You are given a permutation $P$ of length $N$. A permutation of length $N$ is an array of length $N$ that contains every integer from $1$ to $N$. It can be modified by performing the following operation: - Choose indices $L$ and $R$ ($1 \leq L \leq R \leq N$) such that the subarray $[P_L, P_{L+1}, \ldots, P_R]$ is **not** sorted in ascending order. - Then, do one of the following: - Move ele