//Author : Nikoli Rinaldi
//Array testing

float sum;
float average;
float big;
float z = 20;

int x = 112; //amount of numbers being added

float[] Numbers = new float [x];



void setup(){
  size(800,600);
  background(140);
  counting();          //making new numbers
  adding();            //adding the numbers
  averaging();         //taking the average
  big();               //finding the biggest number
  display();
}




void draw(){
}



void display(){
  
  float x = 20;
  float y = 20;
  float c = 0; 

  background(140);
  textSize(z);
  for (int n = 0; n <  Numbers.length; n ++){  
    if ( y > height - (2*z)){
        y = z;
        c += 1;
      }
    y += z ;
    x = z*5 * c;
    text( Numbers[n], x , y);
   }
  adding();
  averaging();
  big();
}



void counting(){
   for (int n = 0; n <  Numbers.length; n ++){
   Numbers[n] = random(-100,100);
 }
}





void adding(){
  sum = 0;
  for (int n = 0; n < Numbers.length; n ++){
    sum += Numbers[n]; 
   }  
  text( "Sum : " + sum, width/2, height/16);
}





void averaging(){
  average = 0;
  for (int n = 0; n <  Numbers.length; n ++){ 
    average += Numbers[n];
  } 
  average = (average / x);
  text( "Average : " + average, width/2, height/16 + z);
}
    



    
void big(){
  big = 0;
  for (int n = 0; n <  Numbers.length; n ++){
    if (big < Numbers[n]){
      big = Numbers[n];
    }
  }
  text( "Largest value : " + big, width/2, height/16 + 2*z);
}
    
  
  
  
void order(){
  float hold = 0;
  float copy = 0;
  for (int n = 0; n <  Numbers.length - 1; n ++)
    if (Numbers[n] > Numbers[n+1]){
       hold = Numbers[n];
       Numbers[n] = Numbers[n+1];
       Numbers[n+1] = hold;     
  }
  if (copy != hold){
    copy = hold;
    order();
 }
}


void ordering(){
  order();
  display();
}
    
    
    
void keyPressed(){
 if (key == 'r'){
  setup();
 } 
 
 if (key == 's'){
  ordering();
 }
 
}