*From*: Leonard Mada <discoleo gmx net>*To*: gnumeric-list gnome org*Subject*: Re: Median: Oasis and Fast Sorting Algorithm*Date*: Sat, 10 Feb 2007 19:49:53 +0200

Dear Uri, you are very wrong. I made some errors, too, so I repeat the calculations: (with n elements) - initial sort: n/2 * log(n/2) - 2 comparisons per remaining elements: 2*(n/2-1) = n - 2

- when adding all those numbers, we end with: O(...) < n/2 * log(n/2) + n -2 + n/2 * log(n/4) = n * log(n) -2,

Sincerely, Leonard Mada

**Follow-Ups**:**Re: Median: Oasis and Fast Sorting Algorithm***From:*Andreas J. Guelzow

**References**:**Median: Oasis and Fast Sorting Algorithm***From:*Leonard Mada

**Re: Median: Oasis and Fast Sorting Algorithm***From:*Uri David Akavia

**Re: Median: Oasis and Fast Sorting Algorithm***From:*Leonard Mada

**Re: Median: Oasis and Fast Sorting Algorithm***From:*Uri David Akavia

[Date Prev][Date Next] [Thread Prev][Thread Next] [Thread Index] [Date Index] [Author Index]