diff --git a/Week9/Assignment9/bin/ArrayUtility.class b/Week9/Assignment9/bin/ArrayUtility.class
index 5d2cee3..40a83d3 100644
Binary files a/Week9/Assignment9/bin/ArrayUtility.class and b/Week9/Assignment9/bin/ArrayUtility.class differ
diff --git a/Week9/Assignment9/src/ArrayUtility.java b/Week9/Assignment9/src/ArrayUtility.java
index b57f6c7..1964a52 100644
--- a/Week9/Assignment9/src/ArrayUtility.java
+++ b/Week9/Assignment9/src/ArrayUtility.java
@@ -34,7 +34,7 @@ public class ArrayUtility {
 		if(n<=0) return new int[0][0]; //Return to prevent ArithmeticException: / by zero and negative array index
 		if (d.length%n!=0)return new int[0][0]; //Return, empty array, array can't be split into n equal parts
 		int[][] splittedArray = new int[n][d.length/n]; //Create the splitted_array array and initialize it
-		for(int i = 0;i < n;i++)for(int j = 0;j<d.length/n;j++)splittedArray[i][j] = d[i*n+j]; //Loop for n Row and d.length/n column, the position of 2d array is row * ROW_SIZE + column
+		for(int i = 0;i < n;i++)for(int j = 0;j<d.length/n;j++)splittedArray[i][j] = d[i*(d.length/n)+j];//Loop for n Row and d.length/n column, the position of 2d array is row * ROW_SIZE + column
 		return splittedArray; //send the reference back
 	}