It depends on the number of elements in each array. Matt Liotta President & CEO Montara Software, Inc. http://www.montarasoftware.com/ 888-408-0900 x901
> -----Original Message----- > From: jon hall [mailto:jonhall@;ozline.net] > Sent: Monday, November 11, 2002 3:15 PM > To: CF-Talk > Subject: fast compare? > > Using MX is there a relatively simple way to do a fast compare of > two large string arrays? I need to know if an element in an array > is contained in the another. > Currently I'd use something like this > > for(o = 1, o LT arrayLen(ary1), o = o + 1) { > for(i = 1, LT arrayLen(ary2), i = i + 1) { > if(ary1[o] EQ ary2[i]) { > //match... > } > } > } > > This obviously does not scale well. Given the fact that I am not a > CS grad (no quicksort, not ready for that :)), does Java have a good > way to do this kind of compare, that I could use in MX, or is there > another way? > > -- > jon > mailto:jonhall@;ozline.net > > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~| Archives: http://www.houseoffusion.com/cf_lists/index.cfm?forumid=4 Subscription: http://www.houseoffusion.com/cf_lists/index.cfm?method=subscribe&forumid=4 FAQ: http://www.thenetprofits.co.uk/coldfusion/faq Signup for the Fusion Authority news alert and keep up with the latest news in ColdFusion and related topics. http://www.fusionauthority.com/signup.cfm
