Chapter 15 - Sorting algorithms

Chapter 15 - Sorting algorithms

This chapter starts the series on different algorithms used in engineering and scientific applications. In all cases the simplest techniques are introduced first and then improved methods are described. To be able to evaluate the relative performance of the different algorithms the big "O" - Order notation - is described.

For the sorting section six different algorithms are described, each with a supporting program.

The chapter closes with a evaluation of the methods in terms of the number of comparisons and the number of data interchanges needed for different numbers of records. These show a wide range of improvement from the simplest to the more complex ones.

Associated with this chapter is also a graphical demonstration of the different methods. This is available on the associated diskette and is also accessible over the Internet.

       Have a look at the sample programs for this chapter

Browse other websites on this topic

       Come back to the main page