A. Can you draw the animation of Merge sort: given an unsorted array of size 10, show the divide and conquer technique b. What is Running time for Merge Sort: O(nlogn) such that n is the size of the array:
A. Can you draw the animation of Merge sort: given an unsorted array of size 10, show the divide and conquer technique b. What is Running time for Merge Sort: O(nlogn) such that n is the size of the array:
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
A. Can you draw the animation of Merge sort: given an unsorted array of size 10, show the divide and
conquer technique
b. What is Running time for Merge Sort: O(nlogn) such that n is the size of the
array:
Reference code attached
![public class MergeSort {
/** The method for sorting the numbers */
public static void mergeSort (int[] list) {
if (list.length > 1) {
// Merge sort the first half
int[] firstHalf = new int[list.length / 2];
System.arraycopy (list, 0, firstHalf, 0, list.length / 2);
mergeSort (firstHalf);
}
}
}
}
// Merge sort the second half
int secondHalfLength = list.length
int[] secondHalf = new int [secondHalfLength];
System.arraycopy (list, list.length / 2,
secondHalf, 0, secondHalfLength);
mergeSort (secondHalf);
/** Merge two sorted lists */
public static void merge (int[] listl, int[] list2, int[] temp) {
int current1 = 0; // Current index in listl
}
// Merge firstHalf with secondHalf into list
merge (firstHalf, secondHalf, list);
-
int current2 = 0; // Current index in list2
int current 3 = 0; // Current index in temp
while (current1 < listl.length && current2 < list2.length) {
if (listl[currentl] < list2 [current2])
temp [current3++]
list1 [current 1++];
=
list.length / 2;
else
temp [current3++] = list2[current 2++];
while (current1 < list1.length)
temp [current3++] = list1 [currentl++];
while (current2 < list2.length)
temp[current 3++]
=
list2 [current 2++];
/** A test method */
public static void main(String[] args) {
int[] list = {2, 3, 2, 5, 6, 1, -2, 3, 14, 12};
mergeSort (list);
for (int i = 0; i < list.length; i++)
System.out.print(list[i] + " ");](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb64c1c6f-d4d7-4d8b-8ebe-5eadb49feddc%2Fd92afd63-63da-4f2c-a706-f3c6d5edc926%2Fwzul3k_processed.png&w=3840&q=75)
Transcribed Image Text:public class MergeSort {
/** The method for sorting the numbers */
public static void mergeSort (int[] list) {
if (list.length > 1) {
// Merge sort the first half
int[] firstHalf = new int[list.length / 2];
System.arraycopy (list, 0, firstHalf, 0, list.length / 2);
mergeSort (firstHalf);
}
}
}
}
// Merge sort the second half
int secondHalfLength = list.length
int[] secondHalf = new int [secondHalfLength];
System.arraycopy (list, list.length / 2,
secondHalf, 0, secondHalfLength);
mergeSort (secondHalf);
/** Merge two sorted lists */
public static void merge (int[] listl, int[] list2, int[] temp) {
int current1 = 0; // Current index in listl
}
// Merge firstHalf with secondHalf into list
merge (firstHalf, secondHalf, list);
-
int current2 = 0; // Current index in list2
int current 3 = 0; // Current index in temp
while (current1 < listl.length && current2 < list2.length) {
if (listl[currentl] < list2 [current2])
temp [current3++]
list1 [current 1++];
=
list.length / 2;
else
temp [current3++] = list2[current 2++];
while (current1 < list1.length)
temp [current3++] = list1 [currentl++];
while (current2 < list2.length)
temp[current 3++]
=
list2 [current 2++];
/** A test method */
public static void main(String[] args) {
int[] list = {2, 3, 2, 5, 6, 1, -2, 3, 14, 12};
mergeSort (list);
for (int i = 0; i < list.length; i++)
System.out.print(list[i] + " ");
Transcribed Image Text:currentl
↓
19
29
50
70
92
96
98
current2
↓
11
24
33
42
49
66
78
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
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 youDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSONDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag…Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education