I was using "exponential" in the more general form. I did not mean to suggest e**x. You are correct in that N log(N) should represent a worst case.
John P. Baker -----Original Message----- From: IBM Mainframe Discussion List [mailto:[EMAIL PROTECTED] On Behalf Of Paul Gilmartin Sent: 03/09/2008 5:55 PM To: IBM-MAIN@BAMA.UA.EDU Subject: Re: how fast can I sort on mainframe (using DFSORT)? 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
