Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Willem <willem@toad.stack.nl> |
|---|---|
| Newsgroups | comp.theory, comp.programming, sci.math |
| Subject | Re: n bits on of m bits |
| Date | 2011-12-23 18:58 +0000 |
| Organization | Stack Usenet News Service |
| Message-ID | <slrnjf9jqb.318r.willem@toad.stack.nl> (permalink) |
| References | <4344a25e-7fd5-43c5-b43a-a004c9f5f2ad@y7g2000vbe.googlegroups.com> <99d65c5a-7678-4ecc-8b10-b3f475947211@d17g2000prl.googlegroups.com> <slrnjf6ksr.1s2c.willem@toad.stack.nl> <609dd4cd-6c20-4121-a430-f00ee099040c@t36g2000prt.googlegroups.com> |
Cross-posted to 3 groups.
Robin Vowels wrote:
) On Dec 23, 2:58?am, Willem <wil...@toad.stack.nl> wrote:
)> Robin Vowels wrote:
)> ) It is unclear what you want.
)>
)> Read the code then. ?It does what the OP wants, it's just very slow.
)
) The code and the description of the what it dod contradict
) one another.
No, the code and *your interpretation* contradict one another.
) Anyway, even if the OP wants to count one-bits,
) he doen't need to start at 0, because a number that has fewer than
) n bits (without leading zeros) cannot possibly have n one-bits.
) Thus, he needs only consider values from 2**n-1 through 2**m-1.
What kind of speedup would you expect from this if, say,
n is 24 and m is 32 ?
SaSW, Willem
--
Disclaimer: I am in no way responsible for any of the statements
made in the above text. For all I know I might be
drugged or something..
No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
n bits on of m bits Andrew Tomazos <andrew@tomazos.com> - 2011-12-17 08:05 -0800
Re: n bits on of m bits Robert Wessel <robertwessel2@yahoo.com> - 2011-12-17 10:44 -0600
Re: n bits on of m bits Dave <dave_and_darla@Juno.com> - 2011-12-17 08:56 -0800
Re: n bits on of m bits richard@cogsci.ed.ac.uk (Richard Tobin) - 2011-12-17 17:22 +0000
Re: n bits on of m bits "BartC" <bc@freeuk.com> - 2011-12-17 18:23 +0000
Re: n bits on of m bits Andrew Tomazos <andrew@tomazos.com> - 2011-12-17 11:05 -0800
Re: n bits on of m bits Robert Wessel <robertwessel2@yahoo.com> - 2011-12-17 13:24 -0600
Re: n bits on of m bits Robert Wessel <robertwessel2@yahoo.com> - 2011-12-17 13:47 -0600
Re: n bits on of m bits blp@cs.stanford.edu (Ben Pfaff) - 2011-12-17 11:28 -0800
Re: n bits on of m bits "The Last Danish Pastry" <clivet@gmail.com> - 2011-12-19 21:52 +0000
Re: n bits on of m bits kym@kymhorsell.com - 2011-12-19 22:44 +0000
Re: n bits on of m bits Daniel Pitts <newsgroup.nospam@virtualinfinity.net> - 2011-12-19 15:33 -0800
Re: n bits on of m bits kym@kymhorsell.com - 2011-12-20 03:51 +0000
Re: n bits on of m bits Willem <willem@toad.stack.nl> - 2011-12-20 10:05 +0000
Re: n bits on of m bits Patricia Shanahan <pats@acm.org> - 2011-12-20 07:16 -0800
Re: n bits on of m bits Dave <dave_and_darla@Juno.com> - 2011-12-20 07:29 -0800
Re: n bits on of m bits Willem <willem@toad.stack.nl> - 2011-12-20 16:00 +0000
Re: n bits on of m bits The Last Danish Pastry <clivet@gmail.com> - 2011-12-19 16:41 -0800
Re: n bits on of m bits kym@kymhorsell.com - 2011-12-20 04:29 +0000
Re: n bits on of m bits kym@kymhorsell.com - 2011-12-20 19:04 +0000
Re: n bits on of m bits Robin Vowels <robin.vowels@gmail.com> - 2011-12-22 07:25 -0800
Re: n bits on of m bits Willem <willem@toad.stack.nl> - 2011-12-22 15:58 +0000
Re: n bits on of m bits Robin Vowels <robin.vowels@gmail.com> - 2011-12-22 16:26 -0800
Re: n bits on of m bits Willem <willem@toad.stack.nl> - 2011-12-23 18:58 +0000
Re: n bits on of m bits Robin Vowels <robin.vowels@gmail.com> - 2011-12-25 04:01 -0800
Re: n bits on of m bits Dave <dave_and_darla@Juno.com> - 2011-12-25 09:22 -0800
Re: n bits on of m bits Dr J R Stockton <reply1151@merlyn.demon.co.uk> - 2011-12-24 23:36 +0000
Re: n bits on of m bits "io_x" <a@b.c.invalid> - 2011-12-31 16:32 +0100
csiph-web