Updated comments

Author: dlarocque

src/com/example/algorithmvisualizer/AlgVisualizer.java

@@ -247,7 +247,6 @@ public void resetSwingWorker(AlgVisualizer alg, Integer[] arr, ArrDisplay displa
 	}
 
 	// Reset the timer on the previous sort that was done, used in the reset()
-	// method
 	public void resetTime() {
 		startTime = 0;
 		visualizationTime = 0;

src/com/example/algorithmvisualizer/ArrDisplay.java

@@ -57,11 +57,10 @@ public void paintComponent(Graphics g) {
 			swappedIndex1 = -1;
 			swappedIndex2 = -1;
 		} else if (!algVisualizer.stopSort()) {
-			// exclude the first chunk as its used to draw the first array, not related to the sorting
-			swappedIndex1 = swappedIndexes.get(numChunks)[0];	// index out of bounds exception?
+			swappedIndex1 = swappedIndexes.get(numChunks)[0];
 			swappedIndex2 = swappedIndexes.get(numChunks)[1];
 		}
-		// Iterate through the array and drawn every index
+		// Iterate through the array and draw every index
 		for (int i = 0; i < arr.length; i++) {
 			int width = (int) (algVisualizer.getWidth() / (double) arr.length);
 			int height = arr[i] * (algVisualizer.getArrDispHeight() / arr.length);

src/com/example/algorithmvisualizer/ArrSorting.java

@@ -103,6 +103,20 @@ private void sleep() {
 		}
 	}
 
+	/*
+	 * All of the sorting algorithms below are constantly checking in the loops to
+	 * see if sorting has been stopped by a reset. If sorting has been stopped, the
+	 * if statement will be true and the sorting method will be terminated.
+	 * 
+	 * After every index comparison, we add +1 to the total number of index
+	 * comparisons.
+	 * 
+	 * After every index swap, we add the pair of indexes swapped to the list in
+	 * arrDisplay for them to be drawn. We then call publish() and send a clone of
+	 * the array as a chunk to the process(List<> Chunks) method above, where it
+	 * will be painted in the frame.
+	 */
+
 	private void bubbleSort() {
 		for (int i = 0; i < n - 1; i++) {
 			if (algVisualizer.stopSort())