public static void main(String[] args) {
		// new file that we are getting data from
		Scanner inFile = null;
		try {
			// Create a scanner to read the file, file name is parameter
			inFile = new Scanner(new File(System.getProperty("user.dir") + "/src/Files/prog465h.dat"));
		} catch (FileNotFoundException e) {
			System.out.println("File not found!");
			// Stop program if no file found
			System.exit(0);
		}
		// define array
		while (inFile.hasNextLine()) {
			int array[][] = new int[Integer.valueOf(inFile.nextLine())][Integer.valueOf(inFile.nextLine())];
			for (int i = 0; i < array.length; i++) {
				String[] current = inFile.nextLine().split(" ");
				for (int j = 0; j < array[0].length; j++) {
					array[i][j] = Integer.valueOf(current[j]);
				}
			}

			//Store compressed array
			int compressed[][] = compress(array);
			//print original
			System.out.println("Original Matrix: ");
			UtilArray.printArray(array);
			System.out.print("\n");
			//find the amount of numbers stored
			int countOriginal = array.length * array[0].length;
			int countCompressed = compressed.length * compressed[0].length;
			//Find out if the compressed matrix is more efficient
			if (countOriginal > countCompressed) {
				UtilArray.printArray(compressed);
				System.out.println("The original Matrix is Sparse.");
			} else if (countOriginal == countCompressed) {
				UtilArray.printArray(compressed);
				System.out.println("The original Matrix and the Sparse Matrix are Equally Efficient.");
			} else {
				System.out.println("The original matrix is abundant.");
			}
			System.out.println("\n");
		}

	}