On Tue, Jun 14, 2005 at 11:25:52PM -0600, Andrew McNabb wrote:
> I would do this recursively. My PHP stinks, but something like this:
>
> function hello($array)
> {
> foreach ($array as $i => $value) {
> unset ($array[$i]);
> print $element . hello($array);
>
On Tue, Jun 14, 2005 at 11:03:29PM -0600, Dan Wilson wrote:
> Ok folks, I need the help of some good mathematicians/programmers. I
> know some of you are very good with this type of stuff and I am not.
>
> Given an array of elements (with an unknown length), I need to find all
> possible combinat
Ok folks, I need the help of some good mathematicians/programmers. I
know some of you are very good with this type of stuff and I am not.
Given an array of elements (with an unknown length), I need to find all
possible combinations of that array. Say I have an array with the
values of:
'hey', '
Caveat lector. I have not worked for these people, don't know how good
they are.
- Forwarded message from Tonya Whitt <[EMAIL PROTECTED]> -
Date: Tue, 14 Jun 2005 14:02:19 -0600
From: Tonya Whitt <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
Subject: Novell3014 and 3036, week of 6/27, UT
X-Ma
EMServe is looking for a graphic designer.
Great environment and great pay.
I don't know what else to say.
Intrested?
Contact Brock at (801) 785-5069 ext. 3373
EMServe is located at 703 South State Street Suite 5
Right by the scera pool.
.===.
| This has been a P
