qsort is using quicksort so the performance is that of quicksort. It would probably be faster to use maximum_n_ind with an appropriately large number for N and then use qsort or uniq to determine which elements you need.
--Chris On Mon, Oct 20, 2014 at 4:17 AM, Ronak Agrawal <ronagra...@gmail.com> wrote: > Thanks Chris and Derek for the optimized method > > For unique I was going to use squaretotri() and then sort it > The rle had went out of my mind... > > I have a doubt, is it efficient to use the qsort method in large matrix ( > say 5000 x 5000) > > >
_______________________________________________ Perldl mailing list Perldl@jach.hawaii.edu http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
