---

CS 171 - Assignment (Algorithm Analysis)

---

• Files used in the assignment

  This project requires the use of the following files:

  "answer.txt" - text document used to write your answer (turn in the file using the turn in website)

  Download them to your PC before doing this project.

  Abide to the Emory Honor code when doing assignments.

  ---

• Description of the assignment

  • Part 1:

    Find the runtime complexity (= the exact formula) for the running time for the following loop: for (i = 0; i < n; i = i + 2) for (j = i; j < n; j++) doPrimitive(); I.e.: how many times is doPrimitive() executed as a function of n ?

  • Part 2:

    Find the runtime complexity (= the exact formula) for the running time for the following recursive function where the input size n = b - a: public static void recurse(int[] A, int a, int b) { if ( b - a <= 1 ) return; // 0 times for (int i = a; i < b; i++) doPrimitive(); // b-a = n times recurse(A, a, (a+b)/2); recurse(A, (a+b)/2, b); } I.e.: how many times is doPrimitive() executed by a function call recurse(A, a, b) when n = b - a ?

  ---

  ---

  ---

• Turn in instructions

  You must be on Emory campus (e.g.: Emory unplugged) in order to turn in an assignment

  Use your web browser and visit the cs171 turnin website: click here

  Turn in the text file answer.txt using assignment code hw8-a

  Follow the instructions given in homework 1 to turn in.

  ---

• Request extension

  You must be on Emory campus (e.g.: Emory unplugged) in order to make extension requests

  Use your web browser and visit the cs171 turnin website: click here

  Use assignment code hw8 to request extension for this homework.

  Follow the instructions given in homework 1 to request extension.