Re: Big-oh statistics for number of comparisons and run time of new patented sorting algorithm

posting_at_usenet.groups schrieb:

> .....
> What are the Big-oh statistics of this sort for:
>
> 1. Worst (maximum) number of comparisons; and
> 2. Average run time and worst (maximum) run time.
>
> No one has come up with any meaningful statistics,
> possibly because no one really has taken the time to
> understand fully how the sort works.

Take more memory and you can fasten the sort, that's all.

Thomas Received on Thu Jul 29 1999 - 00:00:00 CEST