1. Shown below is the code for the bubble sort consisting of two recursive methods that replace the two nested loops that would be used in its iterative counterpart: void bubbleSort (int array[]) { } sort (array, 0); void sort (int ( ) array, int i) { if (i
1. Shown below is the code for the bubble sort consisting of two recursive methods that replace the two nested loops that would be used in its iterative counterpart: void bubbleSort (int array[]) { } sort (array, 0); void sort (int ( ) array, int i) { if (i
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
Related questions
Question
Don't use ai to answer I will report your answer
Solve both parts properly
![1. Shown below is the code for the bubble sort consisting of two recursive methods that
replace the two nested loops that would be used in its iterative counterpart:
void bubbleSort (int array[]) {
}
sort (array, 0);
void sort (int ( ) array, int i) {
if (i <array.length - 1) {
bubble (array, i, array.length - 1);
sort (array, i + 1)%;B
}
}
void bubble (int[] array, int i, int j) {
if (j <i)
return;
if (array[j] <array[j 1]) {
int temp = array[j];
array[j] = array[j
1];
array[j-1] = temp;
}
}
bubble (array, i, j - 1);
Draw the recursion tee for puppiesort wifen it is called for an array of lengui 4 with
data that represents the worst case. Show the activations of bubbleSort, sort and
bubble in the tree. Explain how the recursion tree would be different in the best case.
2. Kefer back to the recursion tree you provided in the previous problem. Determine a
formula that counts the numbers of modes in that tree. What is Big-✪ for execution time?
Determine a formula that expresses the height of the tree. What is the Big O for memory?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F14cd6867-7ca8-45e4-b2b6-55ca77f46729%2F0d627b06-b340-4b4e-b901-2d3bc1f7c329%2Fl7mvegw_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1. Shown below is the code for the bubble sort consisting of two recursive methods that
replace the two nested loops that would be used in its iterative counterpart:
void bubbleSort (int array[]) {
}
sort (array, 0);
void sort (int ( ) array, int i) {
if (i <array.length - 1) {
bubble (array, i, array.length - 1);
sort (array, i + 1)%;B
}
}
void bubble (int[] array, int i, int j) {
if (j <i)
return;
if (array[j] <array[j 1]) {
int temp = array[j];
array[j] = array[j
1];
array[j-1] = temp;
}
}
bubble (array, i, j - 1);
Draw the recursion tee for puppiesort wifen it is called for an array of lengui 4 with
data that represents the worst case. Show the activations of bubbleSort, sort and
bubble in the tree. Explain how the recursion tree would be different in the best case.
2. Kefer back to the recursion tree you provided in the previous problem. Determine a
formula that counts the numbers of modes in that tree. What is Big-✪ for execution time?
Determine a formula that expresses the height of the tree. What is the Big O for memory?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education