in reply to (tye)Re: Uniquely sorting arrays
in thread Uniquely sorting arrays
I'm using your snippet because it's easier on the memory, nice algorithm too (++ for that) ... but isn't it slower because it keeps going through the entire list? (I haven't looked at the code in Algorithm::Permute though)
Well, saying 'unique' might have been confusing because what I meant was that none of the newly sorted lists should be the same. All of the elements are different anyway.
Shows that my english needs improvement.
Thanks everyone for the help, I really appreciate it.
CBAS.
|
|---|