No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
Hello DaniWeb community! I am writing code for problem 10 of Project Euler. I have decided that the Sieve of Eratosthenes was the best option for creating a list of primes less than two million. Here is my code (yes, I mis-spelled Sieve and Eratosthenes): [CODE]package projecteulerjava; class ProblemTen { … 
|
|
Hi all! I have a array problem I can not figure out. I have an array that I copy in a method and returns the copy, but I do not get a copy of the array. I just get strange values. [CODE] public class AClass { private float[] original = …
|
|
|
I was humming along, and decided to try out data sorting. So, I did a few pieces of research, and came up with a really cool looking algorithm: Quicksort. I did what I should have, and started to program. Now, here is where I sound like an idiot: Why is …
|