Solutions of Theory of Algorithms assignment 8.3-4

Solutions of Theory of Algorithms assignment 8.3-4 - n (n 2...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms Assignment 5 Exercise 8.3-4 As the numbers we want to sort are n integer numbers in the range from 0 to n 2 -1, so we need d digits to represent them, where d = log
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n (n 2 ) = 2 So, according to lemma 8.3, RADIX-SORT correctly sorts these numbers in (d(n + k)) time = (2(n + k)) = (n)...
View Full Document

This note was uploaded on 11/09/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.

Ask a homework question - tutors are online