#TITLE_ALTERNATIVE#

• Main Author: UDY ARIAWAN (NIM 23205022), KETUT
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/10764
• Institution: Institut Teknologi Bandung

Data sorting process generally becomes an important work of data processing. Further examination of this sorting process is considered an interesting topic to investigate. In many applications, sorting thousands, even millions, data consumes the most CPU-time of the overall data processing work. Over the years, many algorithm variations are evolved to solve the sorting problem e.g. priority queue based algorithm (Selection Sort and Heap Sort), order insertion algorithm (Insertion Sort and Tree Sort), transposition algorithm (Bubble Sort), decreasing increment algorithm (Shell Sort), divide and conquer algorithm (Merge Sort and Quick Sort), and address counting algorithm (Radix Sort and Proximity Map Sort). However, there still exist many algorithms that are evolved from the variants of the above-mentioned algorithms.<p> <br /> <br /> <br /> Among the existing sorting algorithms, divide and conquer algorithm, i.e. Merge Sort and Quick Sort, will be evaluated concerning computing time and number of steps. This algorithm is chosen to be analyzed because divide and conquer algorithm is considered fast in data sorting process. C++ language is used in designing process with wx-devcpp visual as the main program and Borland Delphi 7 are the program comparison. Test results show that each of the Merge Sort and Quick Sort algorithm has its own advantages and drawbacks in computing time and number of steps. These advantages and drawbacks are related to the size of input data, the type of input data, and the pivot value determination (particularly for Quick Sort algorithm).