Peevish_Postman.java import java.util.*; /* * CPS 150 * Algorithms & Programming I * * Lab Project: The Peevish Postman Problem (Java Boolean Arrays) * * Name: */ public class Peevish_Postman { public static void main(String[] args) { boolean[] doors; final int NUM_DOORS = 100; final boolean OPEN = true; final boolean CLOSED = false; // Initialize the doors doors = new

This is the file:

// Peevish_Postman.java import java.util.*; /* * CPS 150 * Algorithms & Programming I * * Lab Project: The Peevish Postman Problem (Java Boolean Arrays) * * Name: */ public class Peevish_Postman { public static void main(String[] args) { boolean[] doors; final int NUM_DOORS = 100; final boolean OPEN = true; final boolean CLOSED = false; // Initialize the doors doors = new boolean[NUM_DOORS+1]; // We will not use doors[0] for (int i = 1; i <= NUM_DOORS; i++) { doors[i] = CLOSED; } // Print the initial state of each door (1-100) for (int i = 1; i <= NUM_DOORS; i++) { System.out.print("Door " + i + " is "); if (doors[i]) { System.out.println("open."); } else { System.out.println("closed."); } } // ADD YOUR CODE BETWEEN THIS LINE ... // ... AND THIS LINE // Print the final state of each door (1-100) for (int i = 1; i <= NUM_DOORS; i++) { System.out.print("Door " + i + " is "); if (doors[i]) { System.out.println("open."); } else { System.out.println("closed."); } } } // end main method } // end class Peevish_Postman