An Upper Bound for Sorting $R_n$ with LRE

Sai Satwik Kuppili, Bhadrachalam Chitturi

A permutation $\pi$ over alphabet $\Sigma =1,2,3,\dots ,n$, is a sequence where every element $x$ in $\Sigma$ occurs exactly once. $S_n$ is the symmetric group consisting of all permutations…