<commit_before>/*
 * Implementation of Quick Sort to sort
 * an array in place.
 *
 * Authored on 2/10/2015 by rctillotson25
 *
 */
package algorithms;

public class QuickSort {

	public static void main(String[] args) {
		System.out.println("This is quicksort.");
	}

}<commit_msg>Switching computers - starting on quicksort.<commit_after>/*
 * Implementation of Quick Sort to sort
 * an array in place.
 *
 * Authored on 2/10/2015 by rctillotson25
 *
 */
package algorithms;

public class QuickSort {

	public static void main(String[] args) {
		System.out.println("This is quicksort.");
	}

	// partition array 
	// recursively apply quicksort on each half of array
	public static int[] quickSort(int[] a, int p, int r) {
		if (p < r) {
			return a;
		}

		a = partition(a, 
		

	}

}
{'fraction_non_alphanumeric': 0.11308767471410419, 'fraction_numerical': 0.022871664548919948, 'mean_word_length': 3.2594594594594595, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1041788', 'n_tokens_mistral': 283, 'n_tokens_neox': 256, 'n_words': 88}