دراسة كفاءة خوارزميات الترتيب بالتطبيق على خوارزميات NK-sorting ومشكلة التصادم في خوارزمية Radix and NK-sorting

Abstract

This study focuses on the concept of Sorting, in which data Sorting is the repeated use in data processing, we mean by the data sorting is set records are sorted using sorting algorithm, That the most important uses of sorting is to facilitate or speed up the search for the record [20].
in this study we used number of modern sorting algorithm this algorithm is (shell Sort Algorithm, Merge Sort algorithm, Heap Sort algorithm, Radix Sort algorithm and NK-Sorting algorithm) with varying efficiency of these algorithms in terms of speed space of memory and stability algorithm.