I've done it, be afraid, be very afraid. Sorting 1600 records client-side (even using an enhanced quicksort or radix sort) is going to a) be slow and b) be a real pain to get working right.
It may just be me, but every time I try to write a sorting routine I always get it wrong at least once and end up crashing something. Plus the database is optimized for sorting whereas the browser is not.
I would suggest using e refreshbefore using client-side methods.
If your going to go client-side, I would create an ordering scheme so that it only has to be done one time and then re-used each time. Basically hat I mean by this is to create a binary tree node object that can hold a value, a compare type, a compare method, and a toString method. Then create binary search trees for each searchable field that stores either the entire record or simply the key from that record in the node. This way when you need an ordered list you can simply get the values (ASC would be left to right, descending would be right to left) and you wouldn't have to go throughj a laboriuos re-order every time.
I just thought this up, so don't have any examples of what appears to be a rather complex solution. Not to count the fact that you will need to dynamically destory and creates your table rows for the display each time the user re-orders whether you use my method or an ordering algorithm.
-Tarwn ________________________________________________
Get better results for your questions: faq333-2924
Frequently Asked ASP Questions: faq333-3048