<p>The transform and its inverse can be computed in linear time and consuming linear storage. Check out the following <a href="https://arxiv.org/pdf/1201.3077.pdf" rel="nofollow noreferrer">paper</a>.</p>
Bijective String Sorting Transform
<p>I have some difficulty finding the complexity of the <strong>Bijective String Sorting Transform</strong>. Does anybody know the complexity of the transform?</p>