On Sun, 9 Mar 2008 17:41:02 -0400, John P. Baker wrote: > >What you have to remember is that the time required for a sort does not grow >linearly with the number of records, but is an exponential function, when > ???
I would hope for no worse than N log( N ) for any decently crafted technique; hardly exponential; barely polynomial. Heck, even bubble sort is only N**2. -- gil ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO Search the archives at http://bama.ua.edu/archives/ibm-main.html
