Options
Analysis of sorting algorithms
Author
Sim, Seok Woon
Supervisor
Shutler, Paul
Abstract
A sorting algorithm is considered as one of the more important branches of Computer Science due to its many indispensable applications in life. Sorting algorithms can be classified according to their complexities and improving its efficiency has been a top priority for researchers. In this paper, I will look at three different classes of sorting algorithm progressively. The main aim of looking into these classes of algorithms is to study the complexity of each class of sorting algorithm in a more detailed manner so that we can better understand and explain any differences between the theory we constructed and the result tabulated after executing the actual programme. In studying each algorithm, we will also make use of the most fundamental counting of lines method to prove the algorithm's complexity. Besides verifying the complexity for each class of sorting algorithm, another aim of this paper is to create a better and more efficient algorithm which is simpler in terns of its programming structure compared to renowned professional grade algorithms. We will also test and prove the validity of this new algorithm using the same fundamental counting of lines method. In all, we will find that the more specific and precise we are in programming a sorting algorithm, the better and more efficient the results will be, which is just like the case of the sorting algorithm created in this paper.
Date Issued
2005
Call Number
QA9.58 Sim
Date Submitted
2005