Internal sorting algorithms constitute a class of utility programs that are widely used in performing routine computing operations. This thesis examines the theory and structures of these algorithms and illustrates their basic principles with flowcharts and tabular presentations. PASCAL codes were also developed and implemented for the methods.
