Algorithms

for (i = 0; i < m, i + +){
    for (j = 0; j < n, j + +){
      if (a = b){
        arr[i][j] = 1;
      }
      else{
        arr[i][j] = 2;
      }
    }
}

for (i = 0; i < m, i + +){
    for (j = 0; j < n, j + +){
      arr[i] += arr[i][j];
    }
}

for (i = 0; i < m, i + +){
  if (a = b){
    p[i] = i
    q [i] = i
  }
}

for (i = 0; i < m, i + +){
  sum = 0;
    for (j = 0; j < n, j + +){
      if (a = b){
        arr[i][j] = 1
        sum += 1;
      }
      else{
         arr[i][j] = 2
      }
    }
    if (c = d){
      arr[i] = sum;
      p[i] = i
      q [i] = i
    }   
}

Algorithm-1
--------------------------
1.for 1 to m
   for 1 to n
	if (some condition)
      do something
	else
	  do something
   end for
  end for
2.for 1 to m
   for 1 to n
    do something
   end for
  end for
3.for 1 to m
	if (some condition)
      do something
  end for
4.do something
5.for 1 to m
   for 1 to m
    if (some condition)
      do something
   end for
  end for
6.for x to y
   for 1 to x
    if (some condition)
      do something
   end for
  end for

Algorithm-2
--------------------------
1.for 1 to m
   for 1 to n
	if (condition)
     do something
	else
	 do something
   end for
   if (condition)
    do something
  end for
2. do something
3.for 1 to m
   for 1 to m
    if (condition)
      do something
	  for 1 to x
	    if (condition)
		  do something
		  break
	  end for
	  if (condition)
		do something
   end for
  end for

public static List<Integer> sieveEratosthenes(List<Integer> numbers){

    int baseNum = 0;

    while(baseNum < Math.sqrt(numbers.size())){

        for(int i = 1; i < numbers.size()-baseNum; i++){

            if(numbers.get(baseNum+i) % numbers.get(baseNum) == 0)
            {
                numbers.remove(baseNum+i);
            }
        }
        baseNum++;
    }

    System.out.println("Calcs: "+calc);
    return numbers;
}