//Find the biggest element. (Part 1 of the "Selection Sort" algorithm.) // Find the biggest element in the array. //. int n=10, j, big=0; float[] d = new float[n]; // void setup() { size(200,200); } void draw() { background(255); reset( d, n ); // FIll with random. big = findBig( d, n ); // Index of biggest. show( d, n ); // Display the array. text( "Biggest is: " + d[big], 2, 30+n*10 ); noLoop(); } int findBig( float[] a, int n ) { // Return index of biggest. // int j, k=0; for (j=0; j a[k]) k=j; } return k; // Index of biggest. } void show( float[] a, int n ) { // Display all for (j=0; j