Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 23.4, Problem 23.4.2CP
Program Plan Intro
Sorting:
Sorting is a process where the elements of a list are arranged in a particular order. The order of the list can be either present in the ascending order or descending order.
Merge sort:
- The
algorithm will divide the list into two halves and the merger sort algorithm is applied at each half in a recursive way. - The process is repeated in a recursive way until the list that is split is completely sorted.
- Once two halves of the list is sorted, the list is merged to obtain a sorted list.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
SO
You have been given two integer arrays/lists (ARR1 and ARR2) of size N and M, respectively. You need to print their intersection; An intersection for this problem can be defined when both the arrays/lists contain a particular value or to put it in other words, when there is a common value that exists in both the arrays/lists.Note :Input arrays/lists can contain duplicate elements.The intersection elements printed would be in the order they appear in the first sorted array/list (ARR1).Input format :The first line of input contains an integer 'N' representing the size of the first array/list.The second line contains 'N' single space separated integers representing the elements of the first the array/list.The third line contains an integer 'M' representing the size of the second array/list.The fourth line contains 'M' single space separated integers representing the elements of the second array/list.Output format :Print the intersection elements. Each element is printed in a separate…
Java Merge Sort but make it read the data 12, 11, 13, 5, 6, 7 from a file not an array
/* Java program for Merge Sort */
class MergeSort {
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
// Find sizes of two subarrays to be merged
int n1 = m - l + 1;
int n2 = r - m;
/* Create temp arrays */
int L[] = new int[n1];
int R[] = new int[n2];
/*Copy data to temp arrays*/
for (int i = 0; i < n1; ++i)
L[i] = arr[l + i];
for (int j = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];
/* Merge the temp arrays */
// Initial indexes of first and second subarrays
int i = 0, j = 0;
// Initial index of merged subarray array
int k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];…
Consider an array A containing elements 12, 23,
18, 19, 2,7, 8 starting from index 0 to 6. What will
be the sum of the middle three values after the
second pass of the merge procedure in the
merge sort algorithm?
Chapter 23 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 23.2 - Prob. 23.2.1CPCh. 23.2 - Prob. 23.2.2CPCh. 23.2 - Prob. 23.2.3CPCh. 23.3 - Prob. 23.3.1CPCh. 23.3 - Prob. 23.3.2CPCh. 23.3 - Prob. 23.3.3CPCh. 23.4 - Prob. 23.4.1CPCh. 23.4 - Prob. 23.4.2CPCh. 23.4 - What is wrong if lines 615 in Listing 23.6,...Ch. 23.5 - Prob. 23.5.1CP
Ch. 23.5 - Prob. 23.5.2CPCh. 23.5 - Prob. 23.5.3CPCh. 23.5 - Prob. 23.5.4CPCh. 23.6 - Prob. 23.6.1CPCh. 23.6 - Prob. 23.6.2CPCh. 23.6 - Prob. 23.6.3CPCh. 23.6 - Prob. 23.6.4CPCh. 23.6 - Prob. 23.6.5CPCh. 23.6 - Prob. 23.6.6CPCh. 23.6 - Prob. 23.6.7CPCh. 23.6 - Prob. 23.6.8CPCh. 23.6 - Prob. 23.6.9CPCh. 23.7 - Prob. 23.7.1CPCh. 23.7 - Prob. 23.7.2CPCh. 23.8 - Prob. 23.8.1CPCh. 23 - Prob. 23.1PECh. 23 - Prob. 23.2PECh. 23 - Prob. 23.3PECh. 23 - (Improve quick sort) The quick-sort algorithm...Ch. 23 - (Check order) Write the following overloaded...Ch. 23 - Prob. 23.7PECh. 23 - Prob. 23.8PECh. 23 - Prob. 23.10PECh. 23 - Prob. 23.11PECh. 23 - Prob. 23.12PECh. 23 - Prob. 23.13PECh. 23 - (Selection-sort animation) Write a program that...Ch. 23 - (Bubble-sort animation) Write a program that...Ch. 23 - (Radix-sort animation) Write a program that...Ch. 23 - (Merge animation) Write a program that animates...Ch. 23 - (Quicksort partition animation) Write a program...Ch. 23 - (Modify merge sort) Rewrite the mergeSort method...
Knowledge Booster
Similar questions
- Apply Selection Sort on the following list of elements: 16, 23, 19, 6, 20, 10, 34, 54arrow_forwardWrite the algorithm for Quick Sort and sort the following numbers using the samesorting technique.A= [ 20, 26,18, 22, 25,16, 13, 19,15]arrow_forwardGiven the following array: [7,8, 5, 2, 4, 6, 3, 99] Illustrate the sorting of the array using insertion sort. Illustrate the sorting of the array using merge sort.arrow_forward
- Use the bubble sort to sort 9, 15, 3, 4, 3, 15, 7, showing the lists obtained at each step.arrow_forwardConsider an array of length 5, arr[5] = {9,7,4,2,1}. What are the steps of insertions done while running insertion sort on the array? a) 7 9 4 2 1 4 7 9 2 1 2 4 7 9 1 1 2 4 7 9 b) 9 7 4 1 2 9 7 1 2 4 9 1 2 4 7 1 2 4 7 9 c) 7 4 2 1 9 4 2 1 9 7 2 1 9 7 4 1 9 7 4 2 d) 7 9 4 2 1 2 4 7 9 1 4 7 9 2 1 1 2 4 7 9arrow_forwardPlease DO this List in Bubble Sort method Step by Step [7,13,91,6,17,34,47,1,3,61]arrow_forward
- A. Can you draw the animation of Merge sort: given an unsorted array of size 10, show the divide andconquer techniqueb. What is Running time for Merge Sort: O(nlogn) such that n is the size of thearray: Reference code attachedarrow_forwardGiven an array arg[] below, use the incremental approach to sort it in assending order 11 42 35 38 22 45 18 39 3arrow_forwardSort the following array of numbers using counting sort and quick sort. Show all necessary steps of sorting in your run. [23,9,10,34,7,21,18,24,15]arrow_forward
- Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 Give step by step execution of Merge Sort mentioning algorithm. [Bloom Taxonomy: Level 6]arrow_forwardSort the following array in decreased manner using insertion sort [12, 2, 5, 10, 15, 27,4], then sort the same array another time in increased manner and compare between the number of swaps in the two casesarrow_forwardGiven a set of numbers: A = {3, 41, 52, 26, 38, 57, 9, 49}. Use merge-sort to sort the array. Show each step. Use quick-sort to sort the array. Show each step. How many “comparisons” for each algorithm above No code needed just break it down like this 3 41 52 26 38 57 9 49 3 41 52 26 38 57 9 49arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database 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:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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