class stu

void setup(){
 int [][]hours_in={{1,2,5,3,4,2,5},
                             {2,3,4,5,1,2,5},
                             {1,5,3,2,4,5,4},
                             {3,2,1,3,5,4,5},
                             {5,1,2,4,6,4,5}};
  for(int i=0;i<hours_in.length;i++){
   println("People " +(i+1)+ " use the internet "+sum_hrs(hours_in[i])+" hours per week");
   println("  approximately average = "+round(avg_hrs_approximately(hours_in[i]))+" hours per day");
   }
}
int sum_hrs(int []a){
  int sum=0;
  for(int i = 0; i < a.length; i++){
    sum=sum+a[i];
  }
  return sum;
}
float avg_hrs_approximately(int []b){
  float average=0;
  for(int j = 0; j < b.length; j++){
    average=average+b[j];
  }
    average=average/b.length;
    return average;
}

hours of internet use

void setup(){
 int [][]hours_in={{1,2,5,3,4,2,5},
                            {2,3,4,5,1,2,5},
                            {1,5,3,2,4,5,4},
                            {3,2,1,3,5,4,5},
                            {5,1,2,4,6,4,5}};
  for(int i=0;i<hours_in.length;i++){
   println("People " +(i+1)+ " use the internet "+sum_hrs(hours_in[i])+" hours per week");
   println("  approximately average = "+round(avg_hrs_approximately(hours_in[i]))+" hours per day");
   }
}
int sum_hrs(int []a){
  int sum=0;
  for(int i = 0; i < a.length; i++){
    sum=sum+a[i];
  }
  return sum;
}
float avg_hrs_approximately(int []b){
  float average=0;
  for(int j = 0; j < b.length; j++){
    average=average+b[j];
  }
    average=average/b.length;
    return average;
}

Chess table

void setup() {
  size(400, 400);
  int num = 8;//number of slot in line
  int [][]keep_XO_Table = new int[num][num];
  draw_G(keep_XO_Table[num-1]);
}
void draw_G(int []num) {
  for (int i = 0; i < num.length; i++) {
    for (int j = 0; j < num.length; j++) {
      stroke(0);
      if(i%2==0){
          if(j%2==0){
              fill(255);
          }else{fill(100);}
      }else if(i%2!=0){
          if(j%2==0){
              fill(100);
          }else{fill(255);}
      }
      rect(i*(width/num.length), j*(height/num.length), width/num.length, height/num.length);
    }
  }
}

XO table

void setup() {
  size(400, 400);
  int num = 3;//number of slot in line
  int [][]keep_XO_Table = new int[num][num];
  draw_G(keep_XO_Table[num-1]);
}
void draw_G(int []num) {
  for (int i = 0; i < num.length; i++) {
    for (int j = 0; j < num.length; j++) {
      stroke(0);
      fill(255);
      rect(i*(width/num.length), j*(height/num.length), width/num.length, height/num.length);
    }
  }
}

Function to find the index of a value in an array

void setup() {
  int []ArrayEx = { 3, 4, 5};
  Check(3, ArrayEx,"ArrayEx");
  Check(6, ArrayEx,"ArrayEx");
}
void Check(int a, int []b, String c) {
  boolean Tof = false;
  for (int i = 0; i<b.length; i++) {
    if (b[i]==a) {
      Tof = true;
      println(a + " has index = " + i + " in " + c);
    }
  }
  if (Tof == false) {
    println(a + " is not in " + c);
  }
}

Random array

void setup() {
  int []S = new int[10];
  random_array(S,1,10);
  PrintArray(S);
}
void random_array(int []x, int Min, int Max) {
  x[0] = (int)random(Min,Max+0.9999999);
  for (int i = 1; i < (x.length); i++) {
    x[i] = (int)random(Min, Max+0.9999999);  
  } 
} 
void PrintArray(int[] a) {
  print("K = {"+a[0]);
  for (int i=1; i<(a.length); i++) {
    print(","+a[i]);
  }
  println("}");
}

Link - Bitbucket

https://bitbucket.org/a5730085a/assignment1_my_story