# Finalf04 - COT 5405 Analysis of Algorithms Fall 2004...

This preview shows pages 1–3. Sign up to view the full content.

COT 5405 Analysis of Algorithms Fall 2004 On-Campus Comprehensive Exam Name: __________________________________________ UFID: ____________ - ____________ E-mail: _________________________________________ Instructions: 1. Write neatly and legibly 2. While grading, not only your final answer but also your approach to the problem will be evaluated 3. You have to attempt ALL THREE problems. You have choices under each problem. 5. Total time for the exam is 120 minutes 6. You are not allowed to use a calculator for this exam I have read carefully, and have understood the above instructions. On my honor, I have neither given nor received unauthorized aid on this examination. Signature: _____________________________________ Date: ____ (MM) / ____ (DD) / ___________ (YYYY) Analysis of Algorithms Fall 2004 On-Campus Exam #3 Page 1 of 15

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
(7.5 points each = total 15 points) a) There are n distinct unsorted integers ( a i through a n ), and they need to be divided among g groups ( G 1 through G g ) of equal size. You can assume that n is a multiple of g , but g may or may not be an exponent of 2. You must ensure that if a i < a j , a i must be placed in a higher-numbered (or higher-indexed) group than a j . In other words, all the members in a higher-numbered (higher-indexed) group must be bigger than all the elements in any other lower-numbered (lower-indexed) group. Devise an efficient divide-and-conquer algorithm to achieve the above ordering and obtain its complexity in terms of n , and/or g . Analysis of Algorithms Fall 2004
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/27/2011 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.

### Page1 / 15

Finalf04 - COT 5405 Analysis of Algorithms Fall 2004...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online