public static void selectionSort(int[]arr){
	for (int i = 0; i < arr.length; i++) {
		int maxIndex = i;
		for (int j = i + 1; j < arr.length; j++) {
		    if (arr[maxIndex] < arr[j]) {
		        maxIndex = j;
		    }
		}
		if (maxIndex != i) {
		    int temp = arr[maxIndex];
		    arr[maxIndex] = arr[i];
		    arr[i] = temp;
		}
	}
}

public void insertSort(int[] arr){
	for (int i = 1; i < arr.length; i++) {
	    int temp = arr[i];
	    int preIndex = i - 1;
	    while (preIndex >= 0 && arr[preIndex] > temp) {
	        arr[preIndex + 1] = arr[preIndex];
	        preIndex--;
	    }
	    if (preIndex + 1 != i - 1) {
	        arr[preIndex + 1] = temp;
	    }
	}
}

public static void bucketSort(int[] arr) {
    int max = 0;
    int min = Integer.MAX_VALUE;
    for (int i = 0; i < arr.length; i++) {
        if (min > arr[i]) {
            min = arr[i];
        }
        if (max < arr[i]) {
            max = arr[i];
        }
    }

    int[] results = new int[max - min + 1];
    for (int i = 0; i < arr.length; i++) {
        results[adjustIndex(min, arr[i])]++;
    }

    int i = 0, index = 0;
    while (i < results.length) {
        if (results[i] != 0) {
            arr[index++] = min + i;
            results[i]--;
        } else {
            i++;
        }
    }
}

private static int adjustIndex(int min, int value) {
    return value - min;
}

public void bubbleSort(int[] arr){
   for (int i = 1; i < arr.length; i++) {
        for (int j = 0; j < arr.length - i; j++) {
            if (arr[j + 1] < arr[j]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }	
}