Yes, of course it takes more time, the bigger the list is. I know that. ;) But sorting 15-16000 entries takes around 30 secs to complete (on my machine - see sig for specs) with the builtin sort command. I'm hoping to bring it down to around 5-8 seconds. Somehow.. Lol..
Anyway, I have been reading a bit about quicksorting, and it seems to be a genius way of sorting. It's well explained here:
http://www.mycsresource.net/articles/programming/sorting_algos/quicksort/
and here:
http://en.wikipedia.org/wiki/Quicksort
Personally, I'm a bit slow at getting to understand things fully, so coding my own quicksort routine will probably take some time. But I get smarter, so I don't mind too much.. ;)
Anyway, I have been reading a bit about quicksorting, and it seems to be a genius way of sorting. It's well explained here:
http://www.mycsresource.net/articles/programming/sorting_algos/quicksort/
and here:
http://en.wikipedia.org/wiki/Quicksort
Personally, I'm a bit slow at getting to understand things fully, so coding my own quicksort routine will probably take some time. But I get smarter, so I don't mind too much.. ;)