Grade12Programs/src/smallPrograms/day1/ArrayPractice.java
static void quicksort(Integer[] array, int low, int high) {
		if (low < high) {
			int p = partition(array, low, high);
			quicksort(array, low, p);
			quicksort(array, p + 1, high);
		}
	}
// I managed to sort 20 million numbers in < 1 second when not printing the arrays, just an end message

I managed to sort 20 million numbers in < 1 second when not printing the arrays, just an end message
I managed to sort 20 million numbers in < 1 second when not printing the arrays just an end message
static void quicksort(Integer[] array, int low, int high) {
		if (low < high) {
			int p = partition(array, low, high);
			quicksort(array, low, p);
			quicksort(array, p + 1, high);
		}
	}
static void quicksort ( Integer [ ] array , int low , int high ) { if ( low < high ) { int p = partition ( array , low , high ) ; quicksort ( array , low , p ) ; quicksort ( array , p + 1 , high ) ; } }
I managed to sort 20 million numbers in < 1 second when not printing the arrays, just an end message
I managed to sort 20 million numbers in < 1 second when not printing the arrays just an end message