|
Posted by zman on 07/26/06 20:24
all_my_trash@hotmail.com wrote:
> Hello!
>
> I'm trying to write an algorithm which can fill an array with all the
> possible combinations of r out of n, without repetition (maximum
> combinations = n!/(r!(n-r)!))
>
Java code is given here (which will give you the psuedo code for php
code):
http://www.merriampark.com/comb.htm
zafar
------------------------------
http://www.vbuniverse.com
http://sphones.blogspot.com
Navigation:
[Reply to this message]
|