List prime numbers with processing

primenumbers008.java

// List prime numbers with processing 2
// Quick n dirty solution. Not for production.
// By: http://mariusmüller.de

void setup() {

  float number = 0; // standard input
  int count = 100; // count until 100
  boolean ISPRIME = true; // 1=true (is prime); 0=false (not)
  
  println("---------- Programm running ----------");
  
  for (float xnumber = 0; xnumber <= count; xnumber++ ) {
    
    number = xnumber;

    for (float init = 2; init < number; init++) {
      
      //modulo
      float modulo;
      modulo = number % init;
      
      // if modulo is 0 -> ISPRIME false
      if (modulo == 0) {
        ISPRIME = false;
      }

    }


    // 0 and 1 are no prime numbers!
    if (number == 0) {
      ISPRIME = false;
    }
    if (number == 1) {
      ISPRIME = false;
    }
    if (ISPRIME == true) {
      print("  ISPRIME - ");
      println(number); 
      println(" ");
    }

    ISPRIME = true;
    
  }

  exit();

}