/* functions */
quickSort (array[], left, right) {
	new
		i = left, j = right,
		tmp,
		pivot = array[(left+right) /2];

	/* partition */
	while (i <= j) {
		while (array[i] < pivot)
			i++;
		while (array[j] > pivot)
			j++;

		if (i <= j) {
			tmp = array[i];
			array[i] = array[j];
			array[j] = tmp;
			i++;
			j--;
		}
	}

	/* recursion */
	if (left < j)
		quickSort (array, left, j);
	if (i < right)
		quickSort (array, i, right);
}

bubbleSort (array[], maxlen = sizeof (array)) {
	new
		bool:swapped = true,
		j = 0,
		tmp;

	while (swapped) {
		swapped = false;
		j++;
		for (new i = 0; i < maxlen - j; i++) {
			if (array[i] > array[i+1]) {
				tmp = array[i];
				array[i] = array[i+1];
				array[i+1] = tmp;
				swapped = true;
			}
		}
	}
}

selectionSort (array[], maxlen = sizeof (array)) {
	new i, j, tmp, minindex;
	for (i = 0; i < maxlen-1; i++) {
		minindex = i;
		for (j = i+1; j < maxlen; j++) {
			if (array[j] < array[minindex])
				minindex = j;
		}
		if (minindex != i) {
			tmp = array[i];
			array[i] = array[minindex];
			array[minindex] = tmp;
		}
	}
}

insertionSort (array[], maxlen = sizeof (array)) {
	new i, j, tmp;
	for (i = 1; i < maxlen; i++) {
		j = i;
		while (j > 0 && array[j-1] > array[j]) {
			tmp = array[j];
			array[j] = array[j-1];
			array[j-1] = tmp;
			j--;
		}
	}
}