Re: A86: Re: Creating distinct random-integer lists using ASM or BASIC


[Prev][Next][Index][Thread]

Re: A86: Re: Creating distinct random-integer lists using ASM or BASIC




In a message dated 10/2/98 20:37:14 Eastern Daylight Time, QmH@aol.com writes:

> In a message dated 98-10-02 19:50:06 EDT, you write:
>  
>  << In basic you can use rand to get a number between one and 10, scan 
> through
>   the list and if your integer is there already, rerandomize the int and
scan
>   again. >>
>  
>  yea... but how would you scan through the list without it taking a long
time?
> 
>  lets say you had a 50 item list... it would take a very long time.
>  

use sortA, then do a binary search.