diff --git a/java/Chapter 11/Introduction/Quicksort.java b/java/Chapter 11/Introduction/Quicksort.java
index 828361a1..9cdacd0e 100644
--- a/java/Chapter 11/Introduction/Quicksort.java	
+++ b/java/Chapter 11/Introduction/Quicksort.java	
@@ -10,7 +10,7 @@ public static void swap(int[] array, int i, int j) {
 	}
 	
 	public static int partition(int arr[], int left, int right) {
-		int pivot = arr[(left + right) / 2]; // Pick a pivot point. Can be an element.
+		int pivot = arr[(left + right) / 2]; // Pick a pivot point. Can be any element.
 		
 		while (left <= right) { // Until we've gone through the whole array
 			// Find element on left that should be on right