From ss@alesig.de Tue Dec 18 12:22:22 2001
Received: from post.webmailer.de (natwar.webmailer.de [192.67.198.70])
	by swi.psy.uva.nl (8.11.6/8.11.2) with ESMTP id fBIBMM509591
	for <prolog@swi.psy.uva.nl>; Tue, 18 Dec 2001 12:22:22 +0100 (MET)
Received: from alesig.de ([141.41.179.145])
	by post.webmailer.de (8.9.3/8.8.7) with ESMTP id MAA09772
	for <prolog@swi.swi.psy.uva.nl>; Tue, 18 Dec 2001 12:17:55 +0100 (MET)
Message-ID: <3C1F325E.7904C49C@alesig.de>
Date: Tue, 18 Dec 2001 12:11:10 +0000
From: Sebastian Schneider <ss@alesig.de>
X-Mailer: Mozilla 4.7 [de] (WinNT; I)
X-Accept-Language: de
MIME-Version: 1.0
To: prolog <prolog@swi.psy.uva.nl>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Subject: [SWIPL] help please ( newbie )

hello!

i try the following:

*find the min from a list

minimum([], Max, Max).
minimum([Kopf|Rest], Max0, Max):- Max1 is min(Max0, Kopf), minimum(Rest,
Max1, Max).
minimum([Kopf|Rest], Max):- minimum(Rest, Kopf, Max).

*if the min not in list(X) then save min in list(X)

assert(list(min))

*if the min in list(X) ( so list(min) ) then min+1 and save again in
list.

!!!THIS I DONT KNOW!!!

??? i know it cant be very difficult but all i try doesn't work. can
anybopdy give me the missing part? recursive solution would be very
welcome :-)

Many Thanks

Sebastian

