<commit_before>package com.learning.ads;

public class EulerGCD {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}<commit_msg>Recursive Euclidean algorithm to find out gcd<commit_after>package com.learning.ads;

public class EulerGCD {
	
	/**
	 * A recursive implementation of EULER GCD algorithm
	 * @param a
	 * @param b
	 * @return gcd of a and b
	 */
	public static int gcd(int a, int b){
		if(b == 0){
			return a;
		}
		return gcd(b, a%b);
	}

	public static void main(String[] args) {
		System.out.println(gcd(1071,462));

	}

}
{'fraction_non_alphanumeric': 0.11867364746945899, 'fraction_numerical': 0.013961605584642234, 'mean_word_length': 3.4153846153846152, 'pattern_counts': {'":': 0, '<': 3, '<?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': '1075072', 'n_tokens_mistral': 228, 'n_tokens_neox': 197, 'n_words': 62}