explain merge sorting step by step MERGE(A, p, q, r) InL q-p+1 Il length of A[p:q] 2nR=r-q II length of A[q + 1:r] 3 let L[0:nL-1] and R[0:nR-1] be new arrays 4 for i=0 to nL-1 II copy A[p:q] into L[0:nL-1] 5 L[i] = A[p + i] 6 for j = 0 to nR-1 // copy A[q + 1:r] into R[0:nR-1] 7 si=0 9j=0 10k = p 11// As long as each of the arrays L and R contains an unmerged element, R[j] = A[q+j+ 1] copy the smallest unmerged element back into A[p:r]. if L[i] ≤ R[j] 11 12 while i

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
icon
Related questions
Question
100%

Please do not give solution in image format thanku 

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

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Randomized Select Algorithm
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education