ok i have an algorithm for finding all prime numbers up to a number n
i create an array of boolean values with n indices, each element being initially true (the array being that if A(n) is true, then n is a prime number)
then i switch values of 2, then 3, 5, 7, ... x, x <= sqrt(n)
so anyway this is really fast, and it takes about 10 seconds to get a list of primers under Integer.MAX_VALUE in java
but i want to go further without allocating extra memory to the java program during runtime, so i've been trying to think of a way that i can hax it to where i don't need more memory, but i'm having trouble
do you think I should try something funky like 2 arrays with max_value/2 elements, then toss array 1 in the dumpster when it's already written all elements from that array into a file, then use the memory array 1 cleared up and do something weird, like newArray at index i is, in reality, x*max_value + i?
or can you think of something better?

This post was edited by Ectasy on Feb 8 2012 05:35pm

this is my highest rated comment on reddit so far

phil is a talentless hack who only got hired because he sucked the dicks of the people in charge

what jersey shore is to white girls, hon drama is to rickster.

60 mmr left to 1900

wonder if ill manage it

ur big

that's what he said when i slipped it up his ass








oop

s2 going to hire another kid to help with balance

http://www.onrpg.com/MMO/Heroes-of-Newerth/interview/HoN-Interview-New-Game-Mode-in-the-Works

Prickster is a bitch

I think rick is the only one who cares about the direction hon is taking.

I kinda care/kinda don't. I just play to play. I don't mind any updates. I also don't get why people whine about them. :/