Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Consider the following code for Merge Sort. public > void sort(T[] table) { // BASE CASE - A table with one element is sorted already. if (table.length <= 1) return; // GENERAL CASE - divide-and-conquer int halfSize = table.length/2; // Split table into halves. T[] leftTable = (T[]) new Comparable[halfSize]; T[] rightTable = (T[]) new Comparable[table.length - halfSize]: // copy original data into the two smaller arrays System.arraycopy(table, 0, leftTable, O, halfSize); System.arraycopy(table, halfSize, rightTable, O, table.length - halfSize); sort(leftTable); // recursively sort the left half sort(rightTable); // recursively sort the right half // Merge the halves together back into table merge(table, leftTable, rightTable); } In the class lectures we used sample data with n = 8. The value 8 divides in half very nicely. Suppose the size of the original array is n = 81. How many data items are placed in the LEFT sub-problem? How many data items are placed in the RIGHT sub-problem? Enter your answer as a pair of numbers, such as 23, 72

Consider the following code for Merge Sort. public > void sort(T[] table) { // BASE CASE - A table with one element is sorted already. if (table.length <= 1) return; // GENERAL CASE - divide-and-conquer int halfSize = table.length/2; // Split table into halves. T[] leftTable = (T[]) new Comparable[halfSize]; T[] rightTable = (T[]) new Comparable[table.length - halfSize]: // copy original data into the two smaller arrays System.arraycopy(table, 0, leftTable, O, halfSize); System.arraycopy(table, halfSize, rightTable, O, table.length - halfSize); sort(leftTable); // recursively sort the left half sort(rightTable); // recursively sort the right half // Merge the halves together back into table merge(table, leftTable, rightTable); } In the class lectures we used sample data with n = 8. The value 8 divides in half very nicely. Suppose the size of the original array is n = 81. How many data items are placed in the LEFT sub-problem? How many data items are placed in the RIGHT sub-problem? Enter your answer as a pair of numbers, such as 23, 72

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Consider the following code for Merge Sort. public <T extends Comparable<T>> void sort(T] table) { // BASE CASE - A table with one element is sorted already. if (table.length <= 1) return; // GENERAL CASE - divide-and-conquer int halfSize = table.length/2; // Split table into halves. T[] leftTable = (T[]) new Comparable[halfSize]; T[] rightTable = (T[]) new Comparable[table.length - halfSize]; // copy original data into the two smaller arrays System.arraycopy(table, 0, leftTable, O, halfSize); System.arraycopy(table, halfSize, rightTable, O, table.length - halfSize); sort(leftTable); // recursively sort the left half sort(rightTable); // recursively sort the right half // Merge the halves together back into table merge(table, leftTable, rightTable); } In the class lectures we used sample data with n = 8. The value 8 divides in half very nicely. Suppose the size of the original array is n = 81. How many data items are placed in the LEFT sub-problem? How many data items are placed in the RIGHT sub-problem? Enter your answer as a pair of numbers, such as 23, 72
Transcribed Image Text:Consider the following code for Merge Sort. public <T extends Comparable<T>> void sort(T] table) { // BASE CASE - A table with one element is sorted already. if (table.length <= 1) return; // GENERAL CASE - divide-and-conquer int halfSize = table.length/2; // Split table into halves. T[] leftTable = (T[]) new Comparable[halfSize]; T[] rightTable = (T[]) new Comparable[table.length - halfSize]; // copy original data into the two smaller arrays System.arraycopy(table, 0, leftTable, O, halfSize); System.arraycopy(table, halfSize, rightTable, O, table.length - halfSize); sort(leftTable); // recursively sort the left half sort(rightTable); // recursively sort the right half // Merge the halves together back into table merge(table, leftTable, rightTable); } In the class lectures we used sample data with n = 8. The value 8 divides in half very nicely. Suppose the size of the original array is n = 81. How many data items are placed in the LEFT sub-problem? How many data items are placed in the RIGHT sub-problem? Enter your answer as a pair of numbers, such as 23, 72
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS