//Alex Dahlgren CST 112 5/7/15 PROJECT 9 int [] r = new int [10]; int many = r.length; float average = 0; void setup() { size(700,700); reset(); } void reset() { for( int s = 0; s a[biggest]) {biggest = t;} } return biggest; } void small( int [] b ,int tot) { int tiny = wheretiny(b,tot); int temp; temp = b[tiny]; b[tiny] = b[tot-10]; b[tot-10] = temp; } int wheretiny( int b[], int tot) { int smallest = 0; for (int t = 0; t < many; t++ ) { if ( b[t] < b[smallest]) { smallest = t;} } return smallest; } void inc() { for ( int s = 0; s < many; s++) { r[s] = r[s]+1; } } void triple () { for( int s = 0; s < many; s++) { r[s] = r[s]*3; } } void dec() { for( int s = 0; s