Ehm .. I don't want to offend you, but random picking is not sophisticated at all :s Bubble sorting is quite efficient. The number of compares is approximately equal to 0,5.n.n (5000 compares for 100 items). The most efficient method takes about n.ln(n) compares (almost 500 compares for 100 items), but I don't know how to script that. Maybe Google knows?

Edit: hmz .. the method I suggested is indeed very tedious. Maybe you should pick the first song to be presented at random and always the next song as the second one. Ehm .. suppose you pick item 48 first then this should be presented together with 49. I hope you understand ...

Last edited by noMen; 17/09/07 08:31 PM.