gtke

public class quickFind {

	private int [] id;
	
	public void QuickFindUF (int N){
		id = new int [N];
		for(int i = 0; i< N; i++){
			id[i]=i;
		}
	}

gtke

public class quickUnion {
	private int[] id;
	
	public void QuickUnionUF(int N){
		id = new int [N];
		for(int i = 0; i < N; i++){
			id[i] = i;
		}
	}

gtke

import java.util.Scanner;
public class Eratosthenes {

	/**
	 * Sieve of Eratosthenes.
	 * Generates prime numbers.
	 * You can find more about the algorithm here: 
	 * http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
	 * @author gtkesh
	 */

gtke

public static int partition(int arr[], int left, int right){
	      int i = left, j = right;
	      int temp;
	      int pivot = arr[(left + right) / 2];
	     
	      while (i <= j) {
	            while (arr[i] < pivot)
	                  i++;
	            while (arr[j] > pivot)
	                  j--;

gtke

import java.util.ArrayList;
import java.util.Collection;
import java.util.List;

/**
 * BST
 * @author gtkesh
 */
public class BST<T extends Comparable<T>> {

gtke

 /**
    * Adds a data entry to the BST
 * 
 * null is positive infinity
 * 
 * @param data The data entry to add
 */
public void add(T data) {
	root = add(data, root);
}

gtke

public boolean search(T data, Node<T> node){
	if(data != null){
		if(data.compareTo(node.getData()) == 0){
			return true;
		}else{
			if(data.compareTo(node.getData()) < 0){
				if(node.left == null){
					return false;
				}else{
					return search(data, node.left);

gtke

/**
 * Finds the in-order traversal of the BST
 * 
 * @return A list of the data set in the BST in in-order
 */
public List<T> inOrder() {
	List<T> list = new ArrayList<T>();
	inOrder(root, list);
	return list;
}

gtke

/**
 * Removes a data entry from the BST
 * 
 * null is positive infinity
 * 
 * @param data The data entry to be removed
 * @return The removed data entry (null if nothing is removed)
 * 
 */
public T remove(T data) {

gtke

/**
 * Checks if the BST contains a data entry
 * 
 * null is positive infinity
 * 
 * @param data The data entry to be checked
 * @return If the data entry is in the BST 
 */
public boolean contains(T data) {
	if(root == null){