OpenEuphoria

Re: Testing Sequences for Uniqueness

• Posted by ck lester <cklester at YAHOO.COM> Aug 24, 2000
• 459 views

COL (chuckling out loud). I guess you get to a point where you're doin' some
complicated stuff and you simply FORGET the simple stuff.

sheesh.

Thanks, Derek, for the heads up! 

-ck

----- Original Message -----
From: Derek Parnell <dparnell at BIGPOND.NET.AU>
To: <EUPHORIA at LISTSERV.MUOHIO.EDU>
Sent: Thursday, August 24, 2000 3:48 PM
Subject: Re: Testing Sequences for Uniqueness


> What's wrong with "compare()" ? With the program below, I'm getting about
> 32,500 compares per second.
> ---------------------
> atom e
> integer x,i,t
> i=0
> t=5
> e = time()+t
> while time()<e do
> x=compare ({1,2,3,4,5,6},{1,2,3,4,5,6})
> i+=1
> end while
> printf(1, "%f", i/t)
> -------------------------
>
>
>
> ----- Original Message -----
> From: "ck lester" <cklester at YAHOO.COM>
> To: <EUPHORIA at LISTSERV.MUOHIO.EDU>
> Sent: Friday, August 25, 2000 5:38 AM
> Subject: Testing Sequences for Uniqueness
>
>
> > What is the fastest way to check two sequences (of six numbers) for
> > uniqueness?
> >
> > If I have the following:
> >
> > x = { 1 , 2 , 3 , 4 , 5 , 6 }
> > y = { 1 , 2 , 3 , 4 , 5 , 7 }
> >
> > What's the fastest are_different( x , y ) function out there?
> >
> > Thanks in advance!
> > ck
> >
> >
> >
> >
> >
> > __________________________________________________
> > Do You Yahoo!?
> > Talk to your friends online with Yahoo! Messenger.
> > http://im.yahoo.com


__________________________________________________
Do You Yahoo!?
Talk to your friends online with Yahoo! Messenger.
http://im.yahoo.com