Comparison study on sorting techniques in static data structure

Naser Frak, Anwar (2016) Comparison study on sorting techniques in static data structure. Masters thesis, Universiti Tun Hussein Onn Malaysia.

Preview	Text 24p ANWAR NASER FRAK.pdf Download (818kB) | Preview
	Text (Copyright Declaration) ANWAR NASER FRAK COPYRIGHT DECLARATION.pdf Restricted to Repository staff only Download (423kB) | Request a copy
	Text (Full Text) ANWAR NASER FRAK WATERMARK.pdf Restricted to Registered users only Download (2MB) | Request a copy

Abstract

To manage and organize large data is imperative in order to formulate the data analysis and data processing efficiency. Thus, to handle large data becomes highly enviable, whilst, it is premised that the sorting techniques eliminate ambiguities with less effort. Therefore, this study investigates the functionality of a set of sorting techniques to observe which technique to provide better efficiency in terms of sorting data. Therefore, five types of sorting techniques of static data structure, namely: Bubble, Insertion, Selection in group O (n2) complexity and Merge, Quick in group O (n log n) complexity using the C++ programming language have been used. Each sorting technique was tested on four groups between 100 and 30000 of dataset. To validate the performance of sorting techniques, three performance metrics which are time complexity, execution time (run time) and size of dataset were used. All experimental setups were accomplished using simple linear regression where experimental results illustrate that Quick sort is more efficiency than Merge Insertion, Selection and Bubble sort based on run time and size of data using array and Selection sort is more efficient than Bubble and Insertion in large data size using array. In addition, Bubble, Insertion and Selection have good performance for small data size using array while Merge and Quick sort have good performance in large data size using array and sorting technique with good behavior O (n log n) more efficient rather than sorting technique with bad behavior is O (n2) using array.

Item Type:	Thesis (Masters)
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75-76.95 Calculating machines
Divisions:	Faculty of Computer Science and Information Technology > Department of Software Engineering
Depositing User:	Miss Afiqah Faiqah Mohd Hafiz
Date Deposited:	09 Sep 2021 06:01
Last Modified:	09 Sep 2021 06:01
URI:	http://eprints.uthm.edu.my/id/eprint/926

Actions (login required)

View Item