Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #87017 > unrolled thread
| Started by | Chris Angelico <rosuav@gmail.com> |
|---|---|
| First post | 2015-03-06 23:02 +1100 |
| Last post | 2015-03-06 23:02 +1100 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.lang.python
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Speeding up permutations generation Chris Angelico <rosuav@gmail.com> - 2015-03-06 23:02 +1100
| From | Chris Angelico <rosuav@gmail.com> |
|---|---|
| Date | 2015-03-06 23:02 +1100 |
| Subject | Re: Speeding up permutations generation |
| Message-ID | <mailman.107.1425643363.21433.python-list@python.org> |
On Fri, Mar 6, 2015 at 9:33 PM, Mark Lawrence <breamoreboy@yahoo.co.uk> wrote: >> Is the actual generation of permutations your problem? You mentioned >> that you're using itertools, so I would expect that you're simply >> iterating over that; I hope you're not immediately trying to construct >> a list of them all, because that would cost the memory that Mark's >> response talks about. Have you actually profiled your code and found >> that generating permutations is the bottleneck, or did you just guess? >> Because even experienced programmers - even extremely experienced >> Python programmers - are usually wrong when they guess about the >> slowest part of a program. The only way to know is to measure. >> >> ChrisA >> > > s/Mark/Wolfgang/ ? Oops, yes, my bad. I read the rest of the thread, then went back up and replied to the most appropriate post for what I wanted to say, and then named the wrong person out of the two following posters. My apologies, Mark and Wolfgang! ChrisA
Back to top | Article view | comp.lang.python
csiph-web