1. permutation
- Posted by tone.skoda at siol.net May 30, 2002
- 587 views
This is a multi-part message in MIME format. ------=_NextPart_000_0005_01C207E2.3CC45BA0 charset="iso-8859-2" How can I get only unique results from Permutation()? For example, if I use Permutation ({3,1,1,1,0,0}, 6, i) I will get a lot = of results which will be equal to each other. I know I can save all results in a sequence and use find () (or binary = search) to find out if such sequence was already returned from = Permutation(), but is there any faster way? ------=_NextPart_000_0005_01C207E2.3CC45BA0 Content-Type: text/html; charset="iso-8859-2" Content-Transfer-Encoding: quoted-printable <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML><HEAD> <META http-equiv=3DContent-Type content=3D"text/html; = charset=3Diso-8859-2"> <META content=3D"MSHTML 6.00.2600.0" name=3DGENERATOR> <STYLE></STYLE> </HEAD> <BODY bgColor=3D#ffffff> <DIV><FONT face=3DArial size=3D2>How can I get only unique results from=20 Permutation()?</FONT></DIV> <DIV><FONT face=3DArial size=3D2>For example, if I use Permutation = ({3,1,1,1,0,0},=20 6, i) I will get a lot of results which will be equal to each=20 other.</FONT></DIV> <DIV><FONT face=3DArial size=3D2></FONT> </DIV> <DIV><FONT face=3DArial size=3D2>I know I can save all results in a = sequence=20 and use find () (or binary search) to find out if such sequence was = already=20 returned from Permutation(), but is there any faster=20 ------=_NextPart_000_0005_01C207E2.3CC45BA0--
2. Re: permutation
- Posted by Kat <gertie at PELL.NET> May 30, 2002
- 556 views
On 30 May 2002, at 13:59, tone.skoda at siol.net wrote: > > How can I get only unique results from Permutation()? > For example, if I use Permutation ({3,1,1,1,0,0}, 6, i) I will get a lot of > results which will be equal to each other. I don't think mesh() returned duplicates. Kat
3. Re: permutation
- Posted by rforno at tutopia.com May 30, 2002
- 534 views
This is a multi-part message in MIME format. ------=_NextPart_000_00F0_01C20822.CCD7CC00 charset="iso-8859-2" I looked ahead and saw you found how to solve the problem; I haven't yet = analyzed the solution. However, I can think of two ways to do it: 1) Design a different or modified Permutation() to achieve this end. 2) Obtain all permutations that Permutation() generates. Then, sort = them. A simple program can eliminate duplicates easily in a single = pass.. Regards. ----- Original Message -----=20 From: tone.skoda at siol.net=20 To: EUforum=20 Sent: Thursday, May 30, 2002 8:59 AM Subject: permutation How can I get only unique results from Permutation()? For example, if I use Permutation ({3,1,1,1,0,0}, 6, i) I will get a = lot of results which will be equal to each other. I know I can save all results in a sequence and use find () (or binary = search) to find out if such sequence was already returned from = Permutation(), but is there any faster way? ------=_NextPart_000_00F0_01C20822.CCD7CC00 Content-Type: text/html; charset="iso-8859-2" Content-Transfer-Encoding: quoted-printable <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML><HEAD> <META http-equiv=3DContent-Type content=3D"text/html; = charset=3Diso-8859-2"> <META content=3D"MSHTML 5.50.4611.1300" name=3DGENERATOR> <STYLE></STYLE> </HEAD> <BODY bgColor=3D#ffffff> <DIV><FONT size=3D2>I looked ahead and saw you found how to solve the = problem; I=20 haven't yet analyzed the solution.</FONT></DIV> <DIV><FONT size=3D2></FONT> </DIV> <DIV><FONT size=3D2>However, I can think of two ways to do = it:</FONT></DIV> <DIV><FONT size=3D2>1) Design a different or modified Permutation() to = achieve=20 this end.</FONT></DIV> <DIV><FONT size=3D2>2) Obtain all permutations that Permutation() = generates. Then,=20 sort them. A simple program can eliminate duplicates easily in a single=20 pass..</FONT></DIV> <DIV><FONT size=3D2>Regards.</FONT></DIV> <BLOCKQUOTE dir=3Dltr=20 style=3D"PADDING-RIGHT: 0px; PADDING-LEFT: 5px; MARGIN-LEFT: 5px; = BORDER-LEFT: #000000 2px solid; MARGIN-RIGHT: 0px"> <DIV style=3D"FONT: 10pt arial">----- Original Message ----- </DIV> <DIV=20 style=3D"BACKGROUND: #e4e4e4; FONT: 10pt arial; font-color: = black"><B>From:</B>=20 <A title=3Dtone.skoda at siol.net=20 href=3D"mailto:tone.skoda at siol.net">tone.skoda at siol.net</A> </DIV> <DIV style=3D"FONT: 10pt arial"><B>To:</B> <A = title=3DEUforum at topica.com=20 href=3D"mailto:EUforum at topica.com">EUforum</A> </DIV> <DIV style=3D"FONT: 10pt arial"><B>Sent:</B> Thursday, May 30, 2002 = 8:59=20 AM</DIV> <DIV style=3D"FONT: 10pt arial"><B>Subject:</B> permutation</DIV> <DIV><BR></DIV><PRE>=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D The Euphoria = Mailing List =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=20 </PRE> <DIV><FONT face=3DArial size=3D2>How can I get only unique results = from=20 Permutation()?</FONT></DIV> <DIV><FONT face=3DArial size=3D2>For example, if I use Permutation = ({3,1,1,1,0,0},=20 6, i) I will get a lot of results which will be equal to each=20 other.</FONT></DIV> <DIV><FONT face=3DArial size=3D2></FONT> </DIV> <DIV><FONT face=3DArial size=3D2>I know I can save all results = in a sequence=20 and use find () (or binary search) to find out if such sequence was = already=20 returned from Permutation(), but is there any faster = way?</FONT></DIV><PRE>=3D=3D^=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D This email was sent to: rforno at tutopia.com EASY UNSUBSCRIBE click here: <A = href=3D"http://topica.com/u/?b1dd66.b2KSwP">http://topica.com/u/?b1dd66.b= 2KSwP</A> Or send an email to: EUforum-unsubscribe at topica.com T O P I C A -- Register now to manage your mail! <A = href=3D"http://www.topica.com/partner/tag02/register">http://www.topica.c= om/partner/tag02/register</A> =3D=3D^=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D</PRE></BLOCKQUOTE></B= ------=_NextPart_000_00F0_01C20822.CCD7CC00--
4. Re: permutation
- Posted by tone.skoda at siol.net May 31, 2002
- 591 views
Where can I get mesh ()? I know you said by Jiri, which package? I searched my computer for mesh.e, didn't find it. ----- Original Message ----- From: "Kat" <gertie at PELL.NET> To: "EUforum" <EUforum at topica.com> Subject: Re: permutation > > On 30 May 2002, at 13:59, tone.skoda at siol.net wrote: > > > > > How can I get only unique results from Permutation()? > > For example, if I use Permutation ({3,1,1,1,0,0}, 6, i) I will get a lot of > > results which will be equal to each other. > > I don't think mesh() returned duplicates. > > Kat > > > >
5. Re: permutation
- Posted by rforno at tutopia.com May 31, 2002
- 552 views
Kat: I was unable to find mesh.e in the archives. Can you tell me where is it? Regards. ----- Original Message ----- From: "Kat" <gertie at PELL.NET> To: "EUforum" <EUforum at topica.com> Subject: Re: permutation > > On 30 May 2002, at 13:59, tone.skoda at siol.net wrote: > > > > > How can I get only unique results from Permutation()? > > For example, if I use Permutation ({3,1,1,1,0,0}, 6, i) I will get a lot of > > results which will be equal to each other. > > I don't think mesh() returned duplicates. > > Kat > > > >