Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Exercise 2. Present an O(n) algorithm that sorts n positive integer numbers a1, a2,..., an which are known to be bounded by n² – 1 (so 0 ≤ ai ≤ n² − 1, for every i = 1,...,n. Use the idea of Radix Sort (discussed in class and presented in Section 8.3 in the textbook). Note that in order to obtain O(n) you have to do Radix Sort by writing the numbers in a suitable base. Recall that the runtime of Radix Sort is O(d(n+k)), where d is the number of digits, and k is the base, so that the number of digits in the base is also k. The idea is to represent each number in a base k chosen so that each number requires only 2 "digits," so d = 2. Explain what is the base that you choose and how the digits of each number are calculated, in other words how you convert from base 10 to the base. Note that you cannot use the base 10 representation, because n² - 1 (which is the largest possible value) requires log10 (n²-1) digits in base 10, which is obviously not constant and therefore you would not obtain an O(n)-time algorithm. Illustrate your algorithm by showing on paper similar to Fig. 8.3, page 198 in the textbook (make sure you indicate clearly the columns) how the algorithm sorts the following sequence of 12 positive integers: 45, 98, 3, 82, 132, 71, 72, 143, 91, 28, 7, 45. In this example n = 12, because there are 12 positive numbers in the sequence bounded by 143 122 - 1.

Exercise 2. Present an O(n) algorithm that sorts n positive integer numbers a1, a2,..., an which are known to be bounded by n² – 1 (so 0 ≤ ai ≤ n² − 1, for every i = 1,...,n. Use the idea of Radix Sort (discussed in class and presented in Section 8.3 in the textbook). Note that in order to obtain O(n) you have to do Radix Sort by writing the numbers in a suitable base. Recall that the runtime of Radix Sort is O(d(n+k)), where d is the number of digits, and k is the base, so that the number of digits in the base is also k. The idea is to represent each number in a base k chosen so that each number requires only 2 "digits," so d = 2. Explain what is the base that you choose and how the digits of each number are calculated, in other words how you convert from base 10 to the base. Note that you cannot use the base 10 representation, because n² - 1 (which is the largest possible value) requires log10 (n²-1) digits in base 10, which is obviously not constant and therefore you would not obtain an O(n)-time algorithm. Illustrate your algorithm by showing on paper similar to Fig. 8.3, page 198 in the textbook (make sure you indicate clearly the columns) how the algorithm sorts the following sequence of 12 positive integers: 45, 98, 3, 82, 132, 71, 72, 143, 91, 28, 7, 45. In this example n = 12, because there are 12 positive numbers in the sequence bounded by 143 122 - 1.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
= Exercise 2. Present an O(n) algorithm that sorts n positive integer numbers a1, a2, • An which are known to be bounded by n² - 1 (so 0 ≤ ai ≤ n² − 1, for every i 1,..., n. Use the idea of Radix Sort (discussed in class and presented in Section 8.3 in the textbook). Note that in order to obtain O(n) you have to do Radix Sort by writing the numbers in a suitable base. Recall that the runtime of Radix Sort is O(d(n+k)), where d is the number of digits, and k is the base, so that the number of digits in the base is also k. The idea is to represent each number in a base k chosen so that each number requires only 2 "digits," so d = 2. Explain what is the base that you choose and how the digits of each number are calculated, in other words how you convert from base 10 to the base. Note that you cannot use the base 10 representation, because n² – 1 (which is the largest possible value) requires log₁0 (n² - 1) digits in base 10, which is obviously not constant and therefore you would not obtain an O(n)-time algorithm. Illustrate your algorithm by showing on paper similar to Fig. 8.3, page 198 in the textbook (make sure you indicate clearly the columns) how the algorithm sorts the following sequence of 12 positive integers: 45, 98, 3, 82, 132, 71, 72, 143, 91, 28, 7, 45. In this example n = 12, because there are 12 positive numbers in the sequence bounded by 143 122 1. -
Transcribed Image Text:= Exercise 2. Present an O(n) algorithm that sorts n positive integer numbers a1, a2, • An which are known to be bounded by n² - 1 (so 0 ≤ ai ≤ n² − 1, for every i 1,..., n. Use the idea of Radix Sort (discussed in class and presented in Section 8.3 in the textbook). Note that in order to obtain O(n) you have to do Radix Sort by writing the numbers in a suitable base. Recall that the runtime of Radix Sort is O(d(n+k)), where d is the number of digits, and k is the base, so that the number of digits in the base is also k. The idea is to represent each number in a base k chosen so that each number requires only 2 "digits," so d = 2. Explain what is the base that you choose and how the digits of each number are calculated, in other words how you convert from base 10 to the base. Note that you cannot use the base 10 representation, because n² – 1 (which is the largest possible value) requires log₁0 (n² - 1) digits in base 10, which is obviously not constant and therefore you would not obtain an O(n)-time algorithm. Illustrate your algorithm by showing on paper similar to Fig. 8.3, page 198 in the textbook (make sure you indicate clearly the columns) how the algorithm sorts the following sequence of 12 positive integers: 45, 98, 3, 82, 132, 71, 72, 143, 91, 28, 7, 45. In this example n = 12, because there are 12 positive numbers in the sequence bounded by 143 122 1. -
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Counting Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS