Radix sort

• Assumes that all elements in an array have same number of digits

Running Time

• d is constant
• Running time of radix-sort = Running time of stable sort * d
• Use count sort as sorting technique = O(n)
• d* O(n) = O(n)

Radix sort is also linear time sorting technique

Related links 

Single link list                 Stack              AVL Trees             Binary search          Counting Sort

Doubly link list               Queue              Graphs                  Bubble Sort               Radix sort

Circular link list              Binary search tree       Hashing         Insertion Sort         Bucket Sort

Josephus Problem          Tree Traversal              Heaps                Quick Sort              Merge Sort

At Cui tutorial, courses, past papers and final year projects

#tutorial #cui #pastpaper #courses