A Review on Sorting Algorithms: Performance and Complexity
Session
Computer Science and Communication Engineering
Description
The use of computer systems in almost every field has led to an increase in the volume of digital data. However, a large number of digital data has also created the problem of their management, one of the main problems is sort-ing of data. Several different sorting algorithms have been developed for this issue. Therefore in this paper, we have analyzed the main sorting algorithms in relation to time and space complexity, as well as their performance. Also in this paper are identified some of the advantages and disadvantages of dif-ferent sorting algorithms.
Keywords:
Data Structure, Algorithms, Sorting Time, Complexity Space ComplexityPerformance
Session Chair
Bertan Karahoda
Session Co-Chair
Besnik Qehaja
Proceedings Editor
Edmond Hajrizi
ISBN
978-9951-437-96-7
Location
Lipjan, Kosovo
Start Date
31-10-2020 10:45 AM
End Date
31-10-2020 12:30 PM
DOI
10.33107/ubt-ic.2020.503
Recommended Citation
Salihu, Armend; Hoti, Mergim; and Hoti, Arber, "A Review on Sorting Algorithms: Performance and Complexity" (2020). UBT International Conference. 308.
https://knowledgecenter.ubt-uni.net/conference/2020/all_events/308
A Review on Sorting Algorithms: Performance and Complexity
Lipjan, Kosovo
The use of computer systems in almost every field has led to an increase in the volume of digital data. However, a large number of digital data has also created the problem of their management, one of the main problems is sort-ing of data. Several different sorting algorithms have been developed for this issue. Therefore in this paper, we have analyzed the main sorting algorithms in relation to time and space complexity, as well as their performance. Also in this paper are identified some of the advantages and disadvantages of dif-ferent sorting algorithms.