Skip to content

Instantly share code, notes, and snippets.

View tim-peters's full-sized avatar

Tim J. Peters tim-peters

View GitHub Profile
// List prime numbers with processing 2
// Simplified
// By: TiPE
int[] zahlen = new int[101]; // create an array width 101 "parts" called zahlen
int anzahl = 0; // create an int for counting the primes
for(int x=1;x<=100;x++) // count from 1 to 100...
{