Indeed!  Repa and accelerate are really designed as a showcase for pushing the cutting edge of fusion based optimization.  Sorting algorithms, fast matrix multiply, and other locality sensitive algorithms are precisely their weakest spot.  To the point where you really shouldn&#39;t try to use them for such!<div>
<br></div><div>I second the vector-algorithms recommendation. Be prepared for some large compile times, those sorting algs do a lot of Inlining to give you good perf. <span></span></div><div><br>On Thursday, January 23, 2014, Chaddaï Fouché &lt;<a href="mailto:chaddai.fouche@gmail.com">chaddai.fouche@gmail.com</a>&gt; wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">Convert to a vector (that should be efficient since I understand that it is the underlying representation anyway), then use the sort algorithms available in the vector-algorithms package then convert back. You&#39;ll need to use modify to apply the sort (since it works on MVector).<div>

<br></div><div>I don&#39;t think there&#39;s a simpler or better solution right now.</div><div>-- </div><div>Jedaï</div><div class="gmail_extra"><br></div></div>
</blockquote></div>