🚀 go-pugleaf

I've faced this problem, during my studies in the University, and I'm looking for a solution for it till now...
The problem is dealing with RANDOM PROCCESES, and this is how it goes...

	Take a class with a number of N students. And ask each one of them to write a number bigger than zero on a little note (No other limitation, the number can be as big as the student wants or small as he wants; eg. 0.0000001, 1000000, 17.687, well as I said any number bigger than zero).
	Than collect the notes , and start to open the notes one by one (But 
not all of them!). The last note that you open will be called the important 
one.
	The target of this process is that on the important note will be the 
one with the highest number written on it.

	What strategy should I take, in what should I take under 
consideration?
	
I know that this process is called the SECRETARY PROCCES...
But I've not found through gofer, any article dealing with it.

I'm looking for answers, or any pointer, that will direct me to any book,URL, 
or GOPHER site dealing with this issue specifically...
Please answer to my personal E-mail box as well,

Regards

Barak Fishbain 
E-mail: Barak@netmanage.co.il