Comparison study of 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. Therefore, this paper investigates the set of sorting techniques to observe which technique to provide better efficiency. Five types of sorting techniques of static data structure,...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTHM
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/4503/ http://eprints.uthm.edu.my/4503/1/AJ%202018%20%28780%29%20Comparison%20study%20of%20sorting%20techniques%20in%20static%20data%20structure.pdf |
| _version_ | 1848888305836359680 |
|---|---|
| author | Frak, Anwar Naser Saringat, Mohd Zainuri Prasetyo, Yuli Adam Mustapha, Aida Aman, Hannani Ibrahim, Noraini |
| author_facet | Frak, Anwar Naser Saringat, Mohd Zainuri Prasetyo, Yuli Adam Mustapha, Aida Aman, Hannani Ibrahim, Noraini |
| author_sort | Frak, Anwar Naser |
| building | UTHM Institutional Repository |
| collection | Online Access |
| description | To manage and organize large data is imperative in order to formulate the data analysis and data processing efficiency. Therefore, this paper investigates the set of sorting techniques to observe which technique to provide better efficiency. Five types of sorting techniques of static data structure, Bubble, Insertion, Selection with O(n2 ) complexity and Merge, Quick with O(n log n) complexity have been used and tested on four groups between (100–30000) of dataset. To validate the performance of sorting techniques, three performance metrics which are time complexity, execution time and size of dataset were used. All experimental setups were accomplished using simple linear regression. The experimental results illustrate that Quick sort is more efficiency than other sorting 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 thus, sorting technique with behaviour O(n log n) is more efficient than sorting technique with behaviour O(n2 ) using array. |
| first_indexed | 2025-11-15T20:08:11Z |
| format | Article |
| id | uthm-4503 |
| institution | Universiti Tun Hussein Onn Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T20:08:11Z |
| publisher | Penerbit UTHM |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | uthm-45032021-12-07T04:27:28Z http://eprints.uthm.edu.my/4503/ Comparison study of sorting techniques in static data structure Frak, Anwar Naser Saringat, Mohd Zainuri Prasetyo, Yuli Adam Mustapha, Aida Aman, Hannani Ibrahim, Noraini TA168 Systems engineering TA630-695 Structural engineering (General) To manage and organize large data is imperative in order to formulate the data analysis and data processing efficiency. Therefore, this paper investigates the set of sorting techniques to observe which technique to provide better efficiency. Five types of sorting techniques of static data structure, Bubble, Insertion, Selection with O(n2 ) complexity and Merge, Quick with O(n log n) complexity have been used and tested on four groups between (100–30000) of dataset. To validate the performance of sorting techniques, three performance metrics which are time complexity, execution time and size of dataset were used. All experimental setups were accomplished using simple linear regression. The experimental results illustrate that Quick sort is more efficiency than other sorting 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 thus, sorting technique with behaviour O(n log n) is more efficient than sorting technique with behaviour O(n2 ) using array. Penerbit UTHM Article PeerReviewed text en http://eprints.uthm.edu.my/4503/1/AJ%202018%20%28780%29%20Comparison%20study%20of%20sorting%20techniques%20in%20static%20data%20structure.pdf Frak, Anwar Naser and Saringat, Mohd Zainuri and Prasetyo, Yuli Adam and Mustapha, Aida and Aman, Hannani and Ibrahim, Noraini Comparison study of sorting techniques in static data structure. International Journal of Integrated Engineering, 10 (6). pp. 106-112. ISSN 2229-838X |
| spellingShingle | TA168 Systems engineering TA630-695 Structural engineering (General) Frak, Anwar Naser Saringat, Mohd Zainuri Prasetyo, Yuli Adam Mustapha, Aida Aman, Hannani Ibrahim, Noraini Comparison study of sorting techniques in static data structure |
| title | Comparison study of sorting techniques in static data structure |
| title_full | Comparison study of sorting techniques in static data structure |
| title_fullStr | Comparison study of sorting techniques in static data structure |
| title_full_unstemmed | Comparison study of sorting techniques in static data structure |
| title_short | Comparison study of sorting techniques in static data structure |
| title_sort | comparison study of sorting techniques in static data structure |
| topic | TA168 Systems engineering TA630-695 Structural engineering (General) |
| url | http://eprints.uthm.edu.my/4503/ http://eprints.uthm.edu.my/4503/1/AJ%202018%20%28780%29%20Comparison%20study%20of%20sorting%20techniques%20in%20static%20data%20structure.pdf |