Jeremy I think your performance issues can be sorted - {:-) - by Tlist The issue is you can explicitly call sort not the time taken to sort - a quick sort is not the quickest {:-) again Regards Neven --------------------------------------------------------------------------- New Zealand Delphi Users group - Delphi List - [EMAIL PROTECTED] Website: http://www.delphi.org.nz
- Re: [DUG]: Sorting Neven MacEwan
- RE: [DUG]: Sorting Cooke, Andrew
- RE: [DUG]: Sorting Coulter, Jeremy
- Re: [DUG]: Sorting Neven MacEwan
- RE: [DUG]: Sorting Coulter, Jeremy
- Re: [DUG]: Sorting Neven MacEwan
- RE: [DUG]: Sorting McKenzie, Paul
- RE: [DUG]: Sorting Coulter, Jeremy
- RE: [DUG]: Sorting Neil Anderson
- RE: [DUG]: Sorting Coulter, Jeremy
- RE: [DUG]: Sorting Neven MacEwan
- RE: [DUG]: Sorting Neil Anderson
- RE: [DUG]: Sorting Coulter, Jeremy
- Re: [DUG]: Sorting Neven MacEwan
- RE: [DUG]: Sorting Dennis Chuah
- RE: [DUG]: Sorting Coulter, Jeremy
- RE: [DUG]: Sorting Coulter, Jeremy