PROGRAMSKI JEZICI 2

Dynamic memory allocation
• *pprime = 2; // Insert three
• *(pprime+1) = 3; // seed primes
• *(pprime+2) = 5;
• do
• { trial += 2; // Next value for checking
• found = 0; // Set found indicator
• for(int i = 0; i < count; i++)
• // Division by existing primes
• { found =(trial % *(pprime+i)) == 0; // True for exact division
• if(found) // If division is exact
• break; // it's not a prime }
• if (found == 0) // We got one... so save it in
• *(pprime+count++) = trial; // primes array }
• while(count < max);