Investigate the Performance of Various Sorting Techniques Using C++ and Python

Ng, Wei Hong (2022) Investigate the Performance of Various Sorting Techniques Using C++ and Python. Final Year Project (Bachelor), Tunku Abdul Rahman University College.

Text Ng Wei Hong.pdf Restricted to Registered users only Download (2MB)

Abstract

The speed of sorting a list of items can depend quite heavily on the sorting algorithm used, the type of items that are to be sorted and the distribution of these items. In this project, the speed performance of some sorting algorithms including bubble sort, insertion sort, quicksort and selection sort will be investigated using several datasets where each is made up of a long list of 8-bit data, 16-bit data or 32-bit data. The speed of sorting is investigated when the above mentioned data, prior to sorting, are arranged in ascending, descending, and randomized orders. The speed of sorting is further compared and analysed with the sorting algorithms written in Python instead of C++. The effect of slowing down the CPU speed on the performance of insertion sort for both C++ and Python languages is evaluated. Besides, string sorting using bubble sort and insertion sort algorithms are also conducted and compared in this project. Finally, the effect of compiler quality on the performance of a sorting algorithm (bubble sort) is investigated.