Performance Analysis Of Internal Sorting Algorithms

ABSTRACT Internal s o r t i n g a l g o rithms constitute a class of util ity prog rams that are widely used in performi n g rout i n e comput i n g operations . This thesis exam i n es t h e t h eory and structu res of these algorithms and i l l ustrates t h e i r basic principles w i t h f l owcharts and tabular presentations. PASCAL codes were also d evel oped and implemented for the methods.