Please written by computer sourceAttached is the pseudocode for the Merge algorithm. When this algorithm is called with Merge (A, 1, 4, 8) with A = (4, 6, 8, 9, 2, 5, 10, 12), how many times does line 15 execute? How many times does line 17 execute? How many times does line 22 execute? How many times does line 26 execute? MERGE(A, p, q, r)123 let L[0:n4512131415166 for j = 0 to nR-1 // copy Alq +1:r] into R[0:nR - 1]R[j] = A[q+j+1]78nL = q-p+1nR = r-qi=09 j = 0// i indexes the smallest remaining element in L//j indexes the smallest remaining element in R// k indexes the location in A to fill10 kP11// As long as each of the arrays L and R contains an unmerged element,// copy the smallest unmerged element back into A[p:r].while i

Merge algorithm is a well-known divide-and-conquer algorithm used to sort an array of elements. The…

Answered: Attached is the pseudocode for the…

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

Concept explainers

Question

Please written by computer source

Attached is the pseudocode for the Merge algorithm. When this algorithm is called with Merge (A, 1, 4, 8) with A = (4, 6, 8, 9, 2, 5, 10, 12), how many times does line 15 execute? How many times does line 17 execute? How many times does line 22 execute? How many times does line 26 execute?

MERGE(A, p, q, r)
1
2
3 let L[0:n
4
5
12
13
14
15
16
6 for j = 0 to nR-1 // copy Alq +1:r] into R[0:nR - 1]
R[j] = A[q+j+1]
7
8
nL = q-p+1
nR = r-q
i=0
9 j = 0
// i indexes the smallest remaining element in L
//j indexes the smallest remaining element in R
// k indexes the location in A to fill
10 k
P
11
// As long as each of the arrays L and R contains an unmerged element,
// copy the smallest unmerged element back into A[p:r].
while i <n and j<nr
if L[i] ≤ R[j]
A[k] = L[i]
i=i+1
else A[k] = R[j]
j=j+1
20
21
22
23
24
25
// length of A[p:q]
// length of Alq +1:r]
1] and R[0:nR - 1] be new arrays
for i = 0 to n-1 // copy A[p:q] into L[0:n₁ - 1]
L[i] = A[p + i]
17
18
k=k+1
19 // Having gone through one of L and R entirely, copy the
remainder of the other to the end of A[p:r].
//
26
27
while i <nL
A[k] = L[i]
i=i+1
k=k+1
while j<nR
A[k] = R[j]
j=j+1
k=k+1

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Multithreaded Algorithms

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