List the resulting array after each call of the merge method. Indicate the number of character-to-character comparisons made for each call to merge (line 20 of the merge method at the end of the assignment). Sort the following array of characters into alphabetical order: C Q S A X B T. 01 public static void mergesort (char[] a, int 1, int r){0203if (1 >= r) {04return;05}int middle = (1+r)/2;mergesort(a, 1, middle);mergesort(a, middle+1, r);merge(a, 1, middle, r);10 }060708091112 public static void merge (char[] a, int l, int m, int r){13//copy lower half of the array into bchar [] b = new char[m-1+1];for ( int i = 0; i <= m-l; i++ ) {b[i] =}14151617a[1+i];1819= m+1, k = 1;while ( i <= m-l && j <= r ) {0, j20int i =2122if (a[j] < b[i]) {23a [k]alj);24k += 1;j += 1;} else {a [k]252627= b[i];28k += 1;29i += 1;}}3031while ( i <= m-l ) {b[i];3233a [k]34k += 1;35i += 1;36}while ( j <= r ) {alj];3738a[k]39k += 1;40j += 1;}4142 }

Actually, sorting is a elements are in order(ascending or descending)

Answered: List the resulting array after each…

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

See similar textbooks

Related questions

Question

List the resulting array after each call of the merge method. Indicate the number of character-to-character comparisons made for each call to merge (line 20 of the merge method at the end of the assignment). Sort the following array of characters into alphabetical order: C Q S A X B T.

01 public static void mergesort (char[] a, int 1, int r){
02
03
if (1 >= r) {
04
return;
05
}
int middle = (1+r)/2;
mergesort(a, 1, middle);
mergesort(a, middle+1, r);
merge(a, 1, middle, r);
10 }
06
07
08
09
11
12 public static void merge (char[] a, int l, int m, int r){
13
//copy lower half of the array into b
char [] b = new char[m-1+1];
for ( int i = 0; i <= m-l; i++ ) {
b[i] =
}
14
15
16
17
a[1+i];
18
19
= m+1, k = 1;
while ( i <= m-l && j <= r ) {
0, j
20
int i =
21
22
if (a[j] < b[i]) {
23
a [k]
alj);
24
k += 1;
j += 1;
} else {
a [k]
25
26
27
= b[i];
28
k += 1;
29
i += 1;
}
}
30
31
while ( i <= m-l ) {
b[i];
32
33
a [k]
34
k += 1;
35
i += 1;
36
}
while ( j <= r ) {
alj];
37
38
a[k]
39
k += 1;
40
j += 1;
}
41
42 }

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 5 images

SEE SOLUTION Check out a sample Q&A here

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