COMPARISON OF EXISTING INTERNAL SORTING TECHNIQUES

Abstract

This paper illustrates run-time analysis of some existing internal sorting techniquest such as Quick, Heap and Merge to manipulate array size of data.  Random numbers are generated to represent elements in one-dimensional array given a range data interval.  Microsoft Visual C++ is used to write the program for the three types of sorting.  Three cases of best, average and worst are also used to examine the performance of the techniques.  A regression modle with interval array size of umbers is generated for evaluating the performances of the three techniques.