An adaptive comparison-based internal sorting algorithm (S-sort)
Ssort, an adaptive comparison-based internal sorting algorithm in the same order O(n log n) comparisons as that of Classical Quicksort, has been developed. The best case and worst case time complexities of the proposed sorting algorithm have also been analyzed. It was also empirically evaluated on r...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2003
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/3130 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/9968/viewcontent/CDTG003606_F_Redacted.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Ssort, an adaptive comparison-based internal sorting algorithm in the same order O(n log n) comparisons as that of Classical Quicksort, has been developed. The best case and worst case time complexities of the proposed sorting algorithm have also been analyzed. It was also empirically evaluated on randomly-generated data sets with various sortedness ratios. With the application of adaptability measurement, Adaptive Ssort has improved the performance of Ssort. Its best case time complexity is O(n) comparisons while its worst case is O(n log n) comparisons. Similarly, its performance was evaluated and compared with classical Quicksort. |
|---|