الفهرس يوجد فقط 14 صفحة متاحة للعرض العام
 |  | from | 76 |  |  |
| | | from | 76 | | |
المستخلص
We study the performance of the most practical internal adaptive sorting algorithms. Experimental results showed that adaptive AVL sort performs the least number of comparisons unless the number of inversions is fewer than 1%. In such case, splaysort performs the fewest number of comparisons. On the other hand, the running time of Quicksort is superior unless the number of inversions is fewer than 1.5%. in such case, splaysort consumes the smallest running time. Regarding cache misses, greedysort is the best among all the studied algorithms. It makes an optimal number of cache misses. For this reasons, greedysort running time is competitive with Splaysort and Quicksort running times