Hi All, I have a SFSB which gets loaded with database resultsets whenever user makes some searches and this is for per use, not per application. The SFSB has attributes like:
String CustomerId String CustomerName String Address String City When I display the search result, I allow the fields to be sortable (ASC/DESC). And the sorting I like to do it in memory since it is already in Session scope, instead of travel back to database with different ORDER BY clause, and the backend data is pretty static per day. And in my sort algorithm, I like it to take care like in database ORDER BY field1, field2, field3, field4 whereby not only the actual field but with composite to be sorted. If I implement Comparable, compareTo only takes care of per single field not the composite. And the second one is could you give some pointers in what sorting algorithms would be faster for this scenario � the resultset size would be less then 10k for the field size of 5-6, String datatype? Thanks! __________________________________________________ Do You Yahoo!? Great stuff seeing new owners in Yahoo! Auctions! http://auctions.yahoo.com =========================================================================== To unsubscribe, send email to [EMAIL PROTECTED] and include in the body of the message "signoff EJB-INTEREST". For general help, send email to [EMAIL PROTECTED] and include in the body of the message "help".
