Comparison study on sorting techniques in static data structure

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 th...

Full description

Saved in:

Bibliographic Details
Main Author:	Naser Frak, Anwar
Format:	Thesis
Language:	English English English
Published:	2016
Subjects:	QA Mathematics QA76 Computer software
Online Access:	http://eprints.uthm.edu.my/9941/1/24p%20ANWAR%20NASER%20FRAK.pdf http://eprints.uthm.edu.my/9941/2/ANWAR%20NASER%20FRAK%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/9941/3/ANWAR%20NASER%20FRAK%20WATERMARK.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uthm-ep.9941
record_format	uketd_dc
spelling	my-uthm-ep.99412023-09-13T07:31:21Z Comparison study on sorting techniques in static data structure 2016-03 Naser Frak, Anwar QA Mathematics QA76 Computer software 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 0 (n log n) complexity using the C++ programming language have been used. Each sorting technique was tested on four groups between I 00 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.The experimental results illustrate that (I) Quick sort is more efficiency than Merge Insertion, (2) Selection and Bubble sort are more efficient based on run time and size of data using array and (3) 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 2016-03 Thesis http://eprints.uthm.edu.my/9941/ http://eprints.uthm.edu.my/9941/1/24p%20ANWAR%20NASER%20FRAK.pdf text en public http://eprints.uthm.edu.my/9941/2/ANWAR%20NASER%20FRAK%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/9941/3/ANWAR%20NASER%20FRAK%20WATERMARK.pdf text en validuser mphil masters Universiti Tun Hussein Onn Malaysia Fakulti Sains Komputer dan Teknologi Maklumat
institution	Universiti Tun Hussein Onn Malaysia
collection	UTHM Institutional Repository
language	English English English
topic	QA Mathematics QA76 Computer software
spellingShingle	QA Mathematics QA76 Computer software Naser Frak, Anwar Comparison study on sorting techniques in static data structure
description	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 0 (n log n) complexity using the C++ programming language have been used. Each sorting technique was tested on four groups between I 00 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.The experimental results illustrate that (I) Quick sort is more efficiency than Merge Insertion, (2) Selection and Bubble sort are more efficient based on run time and size of data using array and (3) 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
format	Thesis
qualification_name	Master of Philosophy (M.Phil.)
qualification_level	Master's degree
author	Naser Frak, Anwar
author_facet	Naser Frak, Anwar
author_sort	Naser Frak, Anwar
title	Comparison study on sorting techniques in static data structure
title_short	Comparison study on sorting techniques in static data structure
title_full	Comparison study on sorting techniques in static data structure
title_fullStr	Comparison study on sorting techniques in static data structure
title_full_unstemmed	Comparison study on sorting techniques in static data structure
title_sort	comparison study on sorting techniques in static data structure
granting_institution	Universiti Tun Hussein Onn Malaysia
granting_department	Fakulti Sains Komputer dan Teknologi Maklumat
publishDate	2016
url	http://eprints.uthm.edu.my/9941/1/24p%20ANWAR%20NASER%20FRAK.pdf http://eprints.uthm.edu.my/9941/2/ANWAR%20NASER%20FRAK%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/9941/3/ANWAR%20NASER%20FRAK%20WATERMARK.pdf
_version_	1783728971509137408

Comparison study on sorting techniques in static data structure

Similar Items