Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site sdccs7.UUCP
Path: utzoo!watmath!clyde!burl!mgnetp!ihnp4!drutx!houxe!hogpc!houti!ariel!vax135!floyd!harpo!decvax!ittvax!dcdwest!sdcsvax!sdccs7!ee163ahp
From: ee163ahp@sdccs7.UUCP
Newsgroups: net.lang
Subject: Shell sort, quicksort etc. (the real story)
Message-ID: <1257@sdccs7.UUCP>
Date: Thu, 14-Jun-84 10:05:37 EDT
Article-I.D.: sdccs7.1257
Posted: Thu Jun 14 10:05:37 1984
Date-Received: Fri, 15-Jun-84 02:06:57 EDT
References: <678@abnjh.UUCP>
Organization: U.C. San Diego, Computer Center
Lines: 8

The worst case time complexity for quicksort is O(n2), only when the
during the nth call to your partition routine, the partition element
is the nth element. (honest, look it up in Horowitz and Sahni).
This happens very rarely, if you pick the right partition element.

Please send flames if I am wrong. I will never read them, because this
account closes soon.