3-10 array intro and loops

3-10 array intro - i%j=0 if y next i if n next j if(i%j=false isPrime=false isPrime=i%j!= 0 Whether things are static or not depends on whether you

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science 3/10: Arrays and Loops Array introduction: Array: set size Array list: grows in size as needed Ex. Prime Number Program using Loops (Entered in Net Beans Week 7\Primes) (cand=candidate, div=divisor)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: i%j=0 ? if y, next i if n, next j if (i%j=false){ isPrime=false; } isPrime=i%j != 0; Whether things are static or not depends on whether you want objects...
View Full Document

This note was uploaded on 04/27/2008 for the course CMPT 241 taught by Professor Shields during the Spring '08 term at Simons Rock.

Ask a homework question - tutors are online