Question

I need help answering a question in JAVA. Also could you explain exactly what is be asked from this question. I will be including the driver class and one function that needs to be answered.

import java.util.Arrays;

public class A2Driver {

   public static void main(String[] args) {
       for(int i = 10; i <= 50; i+=10)
       {
           System.out.println("N = "+i);
           System.out.println("Sum1:"+A2Work.sum1(i));
           System.out.println("Sum2:"+A2Work.sum2(i));
           System.out.println("Sum3:"+A2Work.sum3(i));
           System.out.println("Sum4:"+A2Work.sum4(i));
           System.out.println("Sum5:"+A2Work.sum5(i));
           System.out.println("Sum6:"+A2Work.sum6(i));
           System.out.println();
       }
       for(int i = 10; i <= 50; i+=10)
       {
           System.out.println("N = "+i);
           System.out.println(Arrays.toString(A2Work.algorithm1(i)));
           System.out.println(Arrays.toString(A2Work.algorithm2(i)));
           System.out.println(Arrays.toString(A2Work.algorithm3(i)));
           System.out.println();
       }
   }

----------------------------------------------------------------------------------------------------------------------------------------------------

Question that needs to be answered and explained. Function that returns sum1

   * NOTE: your f(N) does not need to produce the exact answer as your op count for all sums, but it should be close
   */
  
   /*
   * Grading:
   * Add operation counts - 0.5pt
   * f(N) formula (show your work) - 0.5pt
   * O(N) reduction - 0.5pt
   */
   public static long sum1(int N)//f(N) = ; O(N) =
   {
       long opCount = 0;
       long sum = 0;
       for(int i = 0; i < N; i++)
       {
           sum++;
       }
       System.out.println("f(N) = [f(N)=N*(N-1)/2]");
       System.out.println("O(N) = [O(N)=O(N^2)]");
       System.out.println("OpCount : "+opCount);
       return sum;
   }

Answer 1

CODE

/*

* Grading:

* Add operation counts - 0.5pt

* f(N) formula (show your work) - 0.5pt

* O(N) reduction - 0.5pt

*/

public static long sum1(int N)//f(N) = ; O(N) =

{

long opCount = 0;

long sum = 0;

for(int i = 0; i < N; i++)

{

sum++;

opCount ++;

}

System.out.println("f(N) = N");

System.out.println("O(N) = O(N)");

System.out.println("OpCount : "+opCount);

return sum;

}