...
...
You know, that's just too easy, <sarcasm> but I'm trying to to do this in the most difficult way I can imagine. </sarcasm>
I think I can figure the rest out.
Infact since everything else depends on an algorithum I can just have n the result, this solves about 5 problems at once.
Thanks
I wish I was taking a class, this would be much easier.
This is part of a primality sieve and sadly the hard way of doing it, this system involves about (n/110)^1/2 calculations. The other way while doable has some log determining the steps taken and would be much more difficult to run (rather...
Lets try this:
//Building the array
public class ArrayNumber {
public static void main(String[] args) {
int[] numberArray;
numberArray = new int[100000];
for (int i = 0; i < numberArray.length; i++) {
numberArray[i] = i +1...
HELP!!!!
Sorry couldn't resist
I'm trying to take an array and flag numbers out of that array that fit a pattern (but not remove them).
What I need to do is "flag" every nth number in the array such as every 6th, then run a second pattern that tags every 8th. On top of that each of...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.