🚀 go-pugleaf

gjs@mustang.dsto.gov.au (Graeme Simpkin) writes:

>In fact almost everyone writes.....

>I am really interested in the answer to the original post here, but
>there appears to be a rolling discussion (and great I encourage it),
>but can I ask some kind soul to post an article at the end with the
>header:

Pretty fast (O(nlogn)) sort algorithm -> HERE IT IS
use at your won peril!

sort(t,j)               /* sort t[1] ... t[j] in ascending order */
int *t,j;
{
        int i,k,l,m;

        for (i = j/2; j > 1; t[l] = k) {
                if (i) k = t[i--]; else { k = t[j]; t[j--] = t[1]; }
                for (l = i + 1; (m = l + l) <= j; t[l] = t[m], l = m) {
                        if (m < j && t[m] < t[m+1]) m++;
                        if (t[m] <= k) break;
                }
        }
}


-John Tromp (tromp@cwi.nl)         f() is total -- R.L. Goodstein
define s(n){;auto e,r;for(0;n;n/=b)r+=n%b*(b+1)^s(e++);return(r)}
define f(n){;for(b=2;n;b++)n=s(n)-1;return(b)} for(n=0;1;n++)f(n)