Path: csiph.com!eternal-september.org!feeder.eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: Keith Thompson <kst-u@mib.org>
Newsgroups: comp.lang.c
Subject: Re: Challenge for Feeb: dealing with large numbers in C
Date: Sat, 26 Oct 2019 13:36:52 -0700
Organization: None to speak of
Lines: 14
Message-ID: <lnr22z9rbv.fsf@kst-u.example.com>
References: <e_4rF.285583$iJ2.198603@fx47.iad> <ld2qqedn61hgi25fa0602tle88oobhmspf@4ax.com> <Yq9rF.26213$kV2.22694@fx22.iad> <3pkrF.1790269$HWr.573547@fx36.am4> <CdnrF.146403$hL1.58740@fx35.iad> <K7IrF.3053334$dw4.575231@fx12.am4> <zB_rF.60706$VU2.40054@fx12.iad> <87y2xbvuzb.fsf@bsb.me.uk> <s3fsF.1855772$HWr.1014722@fx36.am4> <877e4uvstq.fsf@bsb.me.uk> <F2qsF.52890$zQ2.14958@fx10.iad> <90254a82-7571-4767-9d6e-90f0d51e6d4c@googlegroups.com> <87wocrtr2y.fsf@bsb.me.uk> <1bo8y39rok.fsf@pfeifferfamily.net>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Injection-Info: reader02.eternal-september.org; posting-host="7704f66ce45f0c9bf0335096efaa4bdc"; logging-data="25554"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18LvMBPoRtfXTb868GXMQjo"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/23.1 (gnu/linux)
Cancel-Lock: sha1:aOMxWboxdORlfNgJT6YTkRuqwwE= sha1:E64wjWayJ+wdJ2y1Gv7HUAn/JfU=
Xref: csiph.com comp.lang.c:147264

Joe Pfeiffer <pfeiffer@cs.nmsu.edu> writes:
[...]
> You lack imagination.  My favorite bad sorting algorithm is permutation
> sort, which generates all permutations on the input data and picks the
> one that's sorted.  This is, of course, what one gets if one writes a
> naive sort in Prolog.

The optimized version of permutation sort allows you to stop searching
when you find the permutation that's sorted.

-- 
Keith Thompson (The_Other_Keith) kst-u@mib.org  <http://www.ghoti.net/~kst>
Will write code for food.
void Void(void) { Void(); } /* The recursive call of the void */