Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package
11th Edition
ISBN: 9780134694511
Author: Liang, Y. Daniel
Publisher: Pearson Education Canada
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 solution
Students have asked these similar questions
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?
Solve the 6 number, 4 is the reference
Topic: Searching and Sorting
Please do it in python:
6.Search 42 in the sorted array of Q. No. 4 using ternary search algorithm. Show the values of low,mid1, mid2, high at each step.
4.Write the algorithm of Merge Sort in brief and show the steps of sorting this array of integersusing Merge Sort. [ 43, 65, 23, 19, 32, 39, 42, 26, 52, 28, 36, 58, 12, 15, 49 ]
Chapter 23 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package
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_forward#Python Program a method merge_sort(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when givena = [1,3,5,6,10]b = [1,4,6,8] the resulting array should be: c = [1,1,3,4,5,6,6,8,10] The program should be implemented WITHOUT using any python libraries such as NumPy or other libraries. This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c.merge_sort(a,b) :arrow_forwardUse the bubble sort to sort 9, 15, 3, 4, 3, 15, 7, showing the lists obtained at each step.arrow_forward
- Consider 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_forwardGiven an array arg[] below, use the incremental approach to sort it in assending order 11 42 35 38 22 45 18 39 3arrow_forwardHere 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_forward
- Please work on a piece of paper. Use insertion sort to sort the following array {6, 2, 5,9, 4, 2, 3, 7, 1, 8, 5}. Any observations here? Is insertion sort stable or not? Is insertion sort in place or not?arrow_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_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_forward
- Given an array A= {12, 11, 13, 5, 6}, sort it out using a technique illustrated in insertion sortarrow_forwardYou are running radix sort (base 10) on values 123, 322, 311, 332, 312, 132, 213, 321, 323. Unfortunately, the counting-sort implementation that your radix-sort calls is "anti-stable", that is, in case of a tie, it always reverses the order of two keys. What is the final order you get? Show the array after each pass.arrow_forwardGiven the following array of elements. Use merge sort in arranging the array in ascending order. Show the step-by-step procedure following the given example above. 2 46 4 19 50 44 38 15 36 26 27 48 7,arrow_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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital 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
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