Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion java/Chapter 11/Introduction/Quicksort.java
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down