When preparing for my oral exam on the subject of Data Structure in the final year of my undergraduate study two years ago, I got the interest to perform an in-depth analysis on the different sorting algorithms presented on Schaum's Outline of Data Structures with C++, which was the textbook for the course, to really see how the sorting algorithms differ. I did the research in 9 days, sent the result to my two friend for comment that I have never got and came to the oral exam totally well prepared. Through the research I also see why Quick Sort is the fastest algorithm out there. So, rather than leaving the result buried in my hard disk forever, I decide to post it here.