AT UE 04

4.1.

C := Array mit min length n + 1  
Insert (n, c){  
	n := n+1  
	i := int((n)/2)  
	while (c < C[i]){  
		C[n] := C[i]  
		n := i  
		i := int((n)/2)  
	}  
	C[n] = c  
}  

C := Array mit min length n + 1  
Delete (n, x){  
	?  
}  

4.2