MINIMUM_MAKSIMUM(A)
	min = A[1]
	max = A[2]
	for i=2 to length[A] by 2:
		if(A[i] < A[i+1):
			if(A[i] < min):
				min = A[i]
			if(A[i+1] > max):
				max = A[i+1]
		else:
			if(A[i+1] < min):
				min = A[i+1]
			if(A[i] > max):
				max = A[i]
	return {min, max}

	śr. O(n)   pes. O(n2)
RANDOMIZED_SELECT(A, l, p ,i)
	if(l == p):
		return A[l]
	q = RANDOMIZED_PARTITION(A, l, p)
	k = q - l + 1
	if(i == k):
		return A[q]
	if(i<k):
		return RANDOMIZED_SELECT(A, l, q-1, i)
	else:
		return RANDOMIZED_SELECT(A, q+1, p, i-k)