Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

  • Congratulations derfloh on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

Search results for query: *

  1. Brellium

    Sorting an array

    ... ... 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
  2. Brellium

    Sorting an array

    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...
  3. Brellium

    Sorting an array

    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...
  4. Brellium

    Sorting an array

    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 &quot;flag&quot; 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...

Part and Inventory Search

Back
Top