Comparison study of sorting techniques in dynamic data structure

Sorting is an important and widely studied issue, where the execution time and the required resources for computation is of extreme importance, especially if it is dealing with real-time data processing. Therefore, it is important to study and to compare in details all the available sorting algorith...

Full description

Saved in:
Bibliographic Details
Main Author: Abbas, Zeyad Adnan
Format: Thesis
Language:English
English
English
Published: 2016
Subjects:
Online Access:http://eprints.uthm.edu.my/9996/2/24p%20ZEYAD%20ADNAN%20ABBAS.pdf
http://eprints.uthm.edu.my/9996/1/ZEYAD%20ADNAN%20ABBAS%20COPYRIGHT%20DECLARATION.pdf
http://eprints.uthm.edu.my/9996/3/ZEYAD%20ADNAN%20ABBAS%20WATERMARK.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uthm-ep.9996
record_format uketd_dc
spelling my-uthm-ep.99962023-09-13T07:35:23Z Comparison study of sorting techniques in dynamic data structure 2016-03 Abbas, Zeyad Adnan QA Mathematics QA71-90 Instruments and machines Sorting is an important and widely studied issue, where the execution time and the required resources for computation is of extreme importance, especially if it is dealing with real-time data processing. Therefore, it is important to study and to compare in details all the available sorting algorithms. In this project, an intensive investigation was conducted on five algorithms, namely, Bubble Sort, Insertion Sort, Selection Sort, Merge Sort and Quick Sort algorithms. Four groups of data elements were created for the purpose of comparison process among the different sorting algorithms. All the five sorting algorithms are applied to these groups. The worst time complexity for each sorting technique is then computed for each sorting algorithm. The sorting algorithms were classified into two groups of time complexity, 0 (n2) group and O(nlog2 n) group. The execution time for the five sorting algorithms of each group of data elements were computed. The fastest algorithm is then determined by the estimated value for each sorting algorithm, which is computed using linear least square regression. The results revealed that the Merge Sort was more efficient to sort data from the Quick Sort for O(nlog2 n) time complexity group. The Insertion Sort had more efficiency to sort data from Selection Sort and Bubble Sort for O (,l) group. Bubble Sort was the slowest or it was less efficient to sort the data. In conclusion, the efficiency of sorting algorithms can be ranked from highest to lowest as Merge Sort. Quick Sort, Insertion Sort, Selection Sort and Bubble Sort 2016-03 Thesis http://eprints.uthm.edu.my/9996/ http://eprints.uthm.edu.my/9996/2/24p%20ZEYAD%20ADNAN%20ABBAS.pdf text en public http://eprints.uthm.edu.my/9996/1/ZEYAD%20ADNAN%20ABBAS%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/9996/3/ZEYAD%20ADNAN%20ABBAS%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
QA71-90 Instruments and machines
spellingShingle QA Mathematics
QA71-90 Instruments and machines
Abbas, Zeyad Adnan
Comparison study of sorting techniques in dynamic data structure
description Sorting is an important and widely studied issue, where the execution time and the required resources for computation is of extreme importance, especially if it is dealing with real-time data processing. Therefore, it is important to study and to compare in details all the available sorting algorithms. In this project, an intensive investigation was conducted on five algorithms, namely, Bubble Sort, Insertion Sort, Selection Sort, Merge Sort and Quick Sort algorithms. Four groups of data elements were created for the purpose of comparison process among the different sorting algorithms. All the five sorting algorithms are applied to these groups. The worst time complexity for each sorting technique is then computed for each sorting algorithm. The sorting algorithms were classified into two groups of time complexity, 0 (n2) group and O(nlog2 n) group. The execution time for the five sorting algorithms of each group of data elements were computed. The fastest algorithm is then determined by the estimated value for each sorting algorithm, which is computed using linear least square regression. The results revealed that the Merge Sort was more efficient to sort data from the Quick Sort for O(nlog2 n) time complexity group. The Insertion Sort had more efficiency to sort data from Selection Sort and Bubble Sort for O (,l) group. Bubble Sort was the slowest or it was less efficient to sort the data. In conclusion, the efficiency of sorting algorithms can be ranked from highest to lowest as Merge Sort. Quick Sort, Insertion Sort, Selection Sort and Bubble Sort
format Thesis
qualification_name Master of Philosophy (M.Phil.)
qualification_level Master's degree
author Abbas, Zeyad Adnan
author_facet Abbas, Zeyad Adnan
author_sort Abbas, Zeyad Adnan
title Comparison study of sorting techniques in dynamic data structure
title_short Comparison study of sorting techniques in dynamic data structure
title_full Comparison study of sorting techniques in dynamic data structure
title_fullStr Comparison study of sorting techniques in dynamic data structure
title_full_unstemmed Comparison study of sorting techniques in dynamic data structure
title_sort comparison study of sorting techniques in dynamic 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/9996/2/24p%20ZEYAD%20ADNAN%20ABBAS.pdf
http://eprints.uthm.edu.my/9996/1/ZEYAD%20ADNAN%20ABBAS%20COPYRIGHT%20DECLARATION.pdf
http://eprints.uthm.edu.my/9996/3/ZEYAD%20ADNAN%20ABBAS%20WATERMARK.pdf
_version_ 1783728982907158528