Originally posted by Jabberwocky
a) using Array.Sort in my application made that sorting account for about 75% of runtime for one typical class of data: I know this for certain as I use profiler extensively, it lead me to Microsoft's source
b) I took source code of Array.Sort and optimised and put into my own class Sorter.Sort - I use same data, every thing else is same: now sorting is less than 10% of run time
Is that clear? If I could achieve such a major speed up without changing data that was sorted or anything else, then something is bloody wrong if Microsoft can't do it out of the box.
madhippy: the application in question is a search engine that should scale as efficiently as possible to billions of pages.

Comment