Update: 2008/11/03
Architecture & coding improvements. Renamed generators.
I am 90% finished writing up a mathematical analysis of my method.
In the process I found an architectural optimization to the sieve
process which is incorporated in the new code. Complexity analysis
showing other interest
I'm translating a program in Python that has this IF Then chain
IF x1 < limit: --- do a ---
IF x2 < limit: --- do b ---
IF x3 < limit: --- do c ---
.-
--
IF x10 < limt: --- do j ---
T
ith code indented 40+
> characters if you keep going.
>
> - Original Message
> From: jzakiya <[EMAIL PROTECTED]>
> To: [EMAIL PROTECTED]
> Sent: Thursday, November 13, 2008 5:06:53 PM
> Subject: Python IF THEN chain equivalence
>
> I'm translating a program in Pytho
On Nov 13, 5:48 pm, "M.-A. Lemburg" <[EMAIL PROTECTED]> wrote:
> On 2008-11-13 23:31, jzakiya wrote:
>
>
>
> > On Nov 13, 5:21 pm, Alan Baljeu <[EMAIL PROTECTED]> wrote:
> >> I think you should rethink your post. The first case you posted makes no
I looked online and in books, but couldn't find a definitive answer to
this.
I have an array and set multiple elements to either True or False at
one time.
Question: Which way is faster (or does it matter)?
1)
array[x1]=array[x2]== array[x10] = \
array[x11]=array[x12]=... = array[x20] =
On Nov 17, 2:10 pm, Arnaud Delobelle <[EMAIL PROTECTED]> wrote:
> jzakiya <[EMAIL PROTECTED]> writes:
> > I looked online and in books, but couldn't find a definitive answer to
> > this.
>
> > I have an array and set multiple elements to either True or Fal
On Nov 4, 4:12 pm, jzakiya <[EMAIL PROTECTED]> wrote:
> Update: 2008/11/03
>
> Architecture & coding improvements. Renamed generators.
>
> I am 90% finished writing up a mathematical analysis of my method.
> In the process I found an architectural optimization to
On Nov 18, 5:01 am, Mark Dickinson <[EMAIL PROTECTED]> wrote:
> On Nov 18, 7:53 am, jzakiya <[EMAIL PROTECTED]> wrote:
>
> >www.4shared.com/account/dir/7467736/97bd7b71/sharing
>
> From the introduction to the paper:
>
> "Thus began a process that cul
On Nov 18, 6:15 pm, Mark Dickinson <[EMAIL PROTECTED]> wrote:
> On Nov 18, 3:58 pm, jzakiya <[EMAIL PROTECTED]> wrote:
>
> > I am writing another paper explaining some of the mathematical basis
> > for the SoZ, with complexity analysis, but I keep finding
> &
On Nov 18, 6:15 pm, Mark Dickinson <[EMAIL PROTECTED]> wrote:
> On Nov 18, 3:58 pm, jzakiya <[EMAIL PROTECTED]> wrote:
>
> > I am writing another paper explaining some of the mathematical basis
> > for the SoZ, with complexity analysis, but I keep finding
> &
This is to announce the release of my paper "Ultimate Prime Sieve --
Sieve of Zakiiya (SoZ)" in which I show and explain the development of
a class of Number Theory Sieves to generate prime numbers. I used
Ruby 1.9.0-1 as my development environment on a P4 2.8 Ghz laptop.
You can get the pdf of
On Jun 13, 1:12 pm, jzakiya <[EMAIL PROTECTED]> wrote:
> This is to announce the release of my paper "Ultimate Prime Sieve --
> Sieve of Zakiiya (SoZ)" in which I show and explain the development of
> a class of Number Theory Sieves to generate prime numbers. I
On Jun 18, 7:58 pm, George Sakkis <[EMAIL PROTECTED]> wrote:
> On Jun 13, 1:12 pm, jzakiya <[EMAIL PROTECTED]> wrote:
>
> > The paper presents benchmarks with Ruby 1.9.0-1 (YARV). I would love
> > to see my variousprimegenerators benchmarked with optimized
> >
FYI for people who need this.
I was looking here
http://www.codecodex.com/wiki/Calculate_an_integer_square_root
for an efficient/fast algorithm for computing integer squareroots.
Based on one of the C version examples, I think this is the most
efficient/fastest that always produces correct res
14 matches
Mail list logo
