Published: Jun 17 2006 / 20:05
Most of these sort sites never mention the fastest site in the world ... no, it's not quicksort. This sort will beat quicksort every time.
for (x=0; x array2[array1[x]]++;
You're a geek ... you figure it out. It has a name but I don't remember it at the moment.
forgot to use code tag. This is what you should be seeing.
for (x=0; x
for (x=0; x<n; x++)
Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.
Advertising - Terms of Service - Privacy - © 1997-2014, DZone, Inc.