|It was a very long article.|
Yes, and sorry, that's my main critique. It should have been shorter esp. for a F.A.Q. The reader is simply clobbered with words...
You should leave out the padding words. For example the first sentence:
|Mergesort is a very flexible, simple algorithm with a whole lot of practical applications.|
-> Mergesort is a flexible algorithm with practical applications.
simple? This seems a contradiciton:
Beginners may be confused by it
practical applications? I'd expect examples or at least a link
The first thing is the table without commentary. I think it needs an introduction. And please, not everyone is familiar with the Big O notation. A short explanation or link would be fine.
|The algorithm first breaks the input into smaller pieces, which at some point are either: (1) already sorted or (2) sorted by some other algorithm, and then merges those smaller sequences back together.|
This confuse me. How is it done? Isn't (1) and (2) the same? Why the numbers? Later:
|Mergesort has so many variations that it would be too much to even mention them all here.|
so many variations...but they're all doing the same?
-> Not all variations [of Mergesort] are mentioned here.
I'd suggest to go through the text and discard unnecessary words and sentences. The reader would be grateful
|Also, I am wondering if I should add any pointers to getting ICU and Boost up and running on Windows using MinGW?|
That has nothing to do with mergesort? But yes that would be good in a F.A.Q