Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #45873
| Path | csiph.com!usenet.pasdenom.info!weretis.net!feeder4.news.weretis.net!ecngs!feeder2.ecngs.de!newsfeed.freenet.ag!news2.euro.net!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail |
|---|---|
| Return-Path | <rosuav@gmail.com> |
| X-Original-To | python-list@python.org |
| Delivered-To | python-list@mail.python.org |
| X-Spam-Status | OK 0.110 |
| X-Spam-Level | * |
| X-Spam-Evidence | '*H*': 0.78; '*S*': 0.00; 'subject:question': 0.10; 'times,': 0.14; '24,': 0.16; 'from:addr:rosuav': 0.16; 'from:name:chris angelico': 0.16; 'iterating': 0.16; 'once.': 0.16; 'index': 0.16; 'wrote:': 0.18; 'requirement.': 0.24; 'header :In-Reply-To:1': 0.27; 'message-id:@mail.gmail.com': 0.30; "i'm": 0.30; 'produces': 0.31; 'provided,': 0.31; 'fri,': 0.33; 'maybe': 0.34; 'but': 0.35; 'received:google.com': 0.35; 'there': 0.35; 'library.': 0.36; 'sequence': 0.36; 'subject:Simple': 0.36; 'should': 0.36; 'list': 0.37; 'easiest': 0.38; 'to:addr:python- list': 0.38; 'pm,': 0.38; 'short': 0.38; 'to:addr:python.org': 0.39; 'most': 0.60; 'tell': 0.60; 'more': 0.64; 'different': 0.65; 'taking': 0.65; 'obvious': 0.74; 'idiot': 0.84; '2013': 0.98 |
| DKIM-Signature | v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type:content-transfer-encoding; bh=cC2ncbDZ4KtDTh/70nE8zoGjLwUSv6wlVjAzZk6OaPE=; b=m23sRjT3ao+PjQUmZhC0YypRzD+76tLwHAtG20L8T356yi2NASxXhM385ao1Kv4afK jncx76PglLqC+ShJO5Xn9MxWtAuKx967yFHtlmpXtl8ELaIo38Pin3ZZwXYGuw4LT+gl cgGjSXeNG05x9oW3yJ3pYyeb2PU8CpdmWnvoCYpaIewFiSaGsh5vvL39K5eQ0vZvwSzH W06Q/1vyyO7yp7hlM+eGYzrM7bx5Qe/vcSeqMOIUAwD3puEiFlZbs+KWIK+JWC7rmY0U JayyeQmS3vyS7Bbj+I5Lxm92928V0brKyFEV95lt4g1+7DZa36P00Q5qgw4KZBI1s9vy frlw== |
| MIME-Version | 1.0 |
| X-Received | by 10.220.167.69 with SMTP id p5mr7798581vcy.57.1369386671148; Fri, 24 May 2013 02:11:11 -0700 (PDT) |
| In-Reply-To | <CAA=1kxSmj_BFwYbvi2yGMSbmCdbtz=7jKo0ADfHCj7s7DXxn-A@mail.gmail.com> |
| References | <a31c773f-88d8-4489-8640-12123d884e4d@m2g2000vbb.googlegroups.com> <CAPTjJmqmWBACxzrFQzVzRDOvft47S7dbeAedFbPTyiahyjpEVQ@mail.gmail.com> <CAA=1kxSmj_BFwYbvi2yGMSbmCdbtz=7jKo0ADfHCj7s7DXxn-A@mail.gmail.com> |
| Date | Fri, 24 May 2013 19:11:11 +1000 |
| Subject | Re: Simple algorithm question - how to reorder a sequence economically |
| From | Chris Angelico <rosuav@gmail.com> |
| To | python-list@python.org |
| Content-Type | text/plain; charset=ISO-8859-1 |
| Content-Transfer-Encoding | quoted-printable |
| X-BeenThere | python-list@python.org |
| X-Mailman-Version | 2.1.15 |
| Precedence | list |
| List-Id | General discussion list for the Python programming language <python-list.python.org> |
| List-Unsubscribe | <http://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe> |
| List-Archive | <http://mail.python.org/pipermail/python-list/> |
| List-Post | <mailto:python-list@python.org> |
| List-Help | <mailto:python-list-request@python.org?subject=help> |
| List-Subscribe | <http://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.2053.1369387054.3114.python-list@python.org> (permalink) |
| Lines | 29 |
| NNTP-Posting-Host | 2001:888:2000:d::a6 |
| X-Trace | 1369387054 news.xs4all.nl 15976 [2001:888:2000:d::a6]:58857 |
| X-Complaints-To | abuse@xs4all.nl |
| Xref | csiph.com comp.lang.python:45873 |
Show key headers only | View raw
On Fri, May 24, 2013 at 6:47 PM, Fábio Santos <fabiosantosart@gmail.com> wrote: > > On 24 May 2013 09:41, "Chris Angelico" <rosuav@gmail.com> wrote: >> >> On Fri, May 24, 2013 at 6:14 PM, Peter Brooks >> <peter.h.m.brooks@gmail.com> wrote: >> > What is the easiest way to reorder a sequence pseudo-randomly? >> > >> > That is, for a sequence 1,2,3,4 to produce an arbitrary ordering (eg >> > 2,1,4,3) that is different each time. >> > > ... > >> It works, it produces a unique list for any given index provided, but >> it's not the cleanest or most efficient. But I know someone'll improve >> on it... or tell me I'm an idiot for not taking a more obvious >> approach :) >> >> ChrisA > > I think that is pretty much itertools.permutations from the standard > library. The OP should check it out. That works if all the permutations are wanted at once. Is there a way, short of iterating over it N times, to request permutation #N? Or maybe I'm misreading the OP and that's not a requirement. ChrisA
Back to comp.lang.python | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 01:14 -0700
Re: Simple algorithm question - how to reorder a sequence economically Chris Angelico <rosuav@gmail.com> - 2013-05-24 18:37 +1000
Re: Simple algorithm question - how to reorder a sequence economically Fábio Santos <fabiosantosart@gmail.com> - 2013-05-24 09:47 +0100
Re: Simple algorithm question - how to reorder a sequence economically Chris Angelico <rosuav@gmail.com> - 2013-05-24 19:11 +1000
Re: Simple algorithm question - how to reorder a sequence economically duncan smith <buzzard@invalid.invalid> - 2013-05-24 15:33 +0100
Re: Simple algorithm question - how to reorder a sequence economically Terry Jan Reedy <tjreedy@udel.edu> - 2013-05-24 06:10 -0400
Re: Simple algorithm question - how to reorder a sequence economically Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2013-05-24 10:52 +0000
Re: Simple algorithm question - how to reorder a sequence economically Ned Batchelder <ned@nedbatchelder.com> - 2013-05-24 07:26 -0400
Re: Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 06:23 -0700
Re: Simple algorithm question - how to reorder a sequence economically Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2013-05-24 13:57 +0000
Re: Simple algorithm question - how to reorder a sequence economically Robert Kern <robert.kern@gmail.com> - 2013-06-12 14:14 +0100
Re: Simple algorithm question - how to reorder a sequence economically John Ladasky <john_ladasky@sbcglobal.net> - 2013-05-24 10:33 -0700
Re: Simple algorithm question - how to reorder a sequence economically John Ladasky <john_ladasky@sbcglobal.net> - 2013-05-25 18:25 -0700
Re: Simple algorithm question - how to reorder a sequence economically Roy Smith <roy@panix.com> - 2013-05-25 21:49 -0400
RE: Simple algorithm question - how to reorder a sequence economically Carlos Nepomuceno <carlosnepomuceno@outlook.com> - 2013-05-24 18:00 +0300
Re: Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 12:01 -0700
RE: Simple algorithm question - how to reorder a sequence economically Carlos Nepomuceno <carlosnepomuceno@outlook.com> - 2013-05-25 00:33 +0300
Re: Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 17:28 -0700
csiph-web