cracking-the-coding-interview | Solutions for the book : Cracking the coding interview V4 | Learning library

public static int partition(int[] array, int left, int right, int pivot) {
		while (left <= right) {
			if (array[left] > pivot) {
				/* Left is bigger than pivot. Swap it to the right
				 * side, where we know it should be. */
				swap(array  

public static int divide(int a, int b) throws java.lang.ArithmeticException {
		if (b == 0) {
			throw new java.lang.ArithmeticException("ERROR: Divide by zero.");
		}
		int absa = abs(a);
		int absb = abs(b);
		
		int product = 0;
		int x = 0;
		whi  

public static int[] pickMRecursively(int[] original, int m, int i) {
		if (i + 1 < m) { // Not enough elements
			return null; 
		} else if (i + 1 == m) { // Base case -- copy first m elements into array
			int[] set = new int[m];
			for (int k =