Solutions of Theory of Algorithms assignment 7.4-5

Solutions of Theory of Algorithms assignment 7.4-5 - will...

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 4 Exercise 7.4-5 a. INSERTION SORT algorithm running time will be O (n(k-1)), and the QUICKSORT will take n lg(n/k). therefore, the described algorithm
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: will take O(nk + nlg(n/k)) b. K can be chosen arbitrary smaller than lg 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