sort, I'll
educate myself on how to make and contribute this change.
Christopher
Christopher Seiwald Perforce Software 1-510-864-7400
[EMAIL PROTECTED] f-f-f-fast SCM http://www.perforce.com
To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe
| How about the code following sig. ?
| And the other codes and information on:
|
| http://www.mars.dti.ne.jp/~a-wada/qsortlib.html
Unfortunately, I only use about 5% of my brain, and am incapable of
convincing myself (or anyone else) of the correctness or efficiency
of your qsort algorithm.
Apparently, someone does love qsort.
Akira Wada wrote:
| I think it would be difficult, not impossible, to decide the threshold
| (Christopher Seiwald said, "# swaps = 1024", and Tim Vanderhoek suggested,
| "a ratio: #comparisons : # swaps") and to what point of qsort, to ma
educate myself on how to make and contribute this change.
Christopher
Christopher Seiwald Perforce Software 1-510-864-7400
seiw...@perforce.com f-f-f-fast SCM http://www.perforce.com
To Unsubscribe: send mail to majord...@freebsd.org
with unsubscribe freebsd-hackers
Answers to sundry comments:
| why don't you implement this w/ the 5 element median selection qsort
| algorithm? my professor for cis413 talked about this algorithm and
| that it really is the fastest qsort algorithm...
qsort algorithms are like stock market tips: only good in retrospect.
The
| How about the code following sig. ?
| And the other codes and information on:
|
| http://www.mars.dti.ne.jp/~a-wada/qsortlib.html
Unfortunately, I only use about 5% of my brain, and am incapable of
convincing myself (or anyone else) of the correctness or efficiency
of your qsort algorithm.
Archie's mod to qsort:
| - if (swap_cnt == 0) { /* Switch to insertion sort */
| + if (n = 32 swap_cnt == 0) { /* Switch to insertion sort */
As Akira Wada points out, this eliminates the benefit of the optimization
in the first place, which is to let isort take over if the data is
Apparently, someone does love qsort.
Akira Wada wrote:
| I think it would be difficult, not impossible, to decide the threshold
| (Christopher Seiwald said, # swaps = 1024, and Tim Vanderhoek suggested,
| a ratio: #comparisons : # swaps) and to what point of qsort, to make
| isort bail back
8 matches
Mail list logo
