Design and Analysis of Algorithms

Spring 2015

National University of Computer and Emerging Sciences, Islamabad

Linear Time Sorting

• Count Sort• Radix Sort• Bucket Sort

When k = O(n) then the sort runs in O(n) time

Determine how many elements are less than an element x

Then place x directly in its correct position