If this is your first visit, be sure to
check out the Forum Rules by clicking the
link above. You may have to register
before you can post: click the register link above to proceed. To start viewing messages,
select the forum that you want to visit from the selection below.

Threaded View

WordList Sorting Question

I have some word lists I got from here, and they're rather large. I want to combine, sort, and unique them. I have them combined (might have to do it again), but I'm wondering what way to sort and make it unique. Most guides I see, from here and other places, say to use "sort | uniq" to fix it. This works, but I also discovered sort has a unique option ("sort -u"). I was wondering if anyone here knew which way was faster. Seeing as how this could run for a long time, I'd like to have whichever one was going to be faster.

If it helps, the computer I'd be running these on would be a Core 2 Duo, with Ubuntu 8.10 x64, with 2GB of Ram. Not sure if that would affect how each one would run, but more info never hurts.