Part II While HeapSort (as we saw in Studio 6) is more amenable than MergeSort to an in-place implementation, MergeSort has its own advantages. For this problem, suppose you want to perform MergeSort on a really huge array A. The array is so big that it doesn't fit in your computer's memory and has to be stored in the cloud. More specifically, assume that our computer has enough memory to hold 36 elements, for some constant b, but A has size n much greater than b. We can call read (X, i, B) to read a chunk of b elements from an array X (in the cloud) starting at index i into a local array B. Similarly, we can call write (C, X, i) to write a chunk of b elements stored in local array C to a cloud array X starting at index i. Here's a proposed (incomplete!) implementation of the merge operation that merges cloud arrays X and Y into cloud array Z. The code uses local arrays A, B, and C, each of size b, to cache X, Y, and Z. For simplicity, we assume that the input arrays X and Y have sizes a multiple of b, and that reading past the end of either X or Y returns values ∞ as in the studio. "mod" is the integer modulo operator (% in Java). MERGE(X, Y, Z) i +0 j+0 k +0 READ(X, 0, A) READ(Y, 0, B) while A[i mod b] <∞ or B[j mod b] < ∞ do u ← A[i mod b] v← B[j mod b] C[k mod b] = min(u, v) if u
Part II While HeapSort (as we saw in Studio 6) is more amenable than MergeSort to an in-place implementation, MergeSort has its own advantages. For this problem, suppose you want to perform MergeSort on a really huge array A. The array is so big that it doesn't fit in your computer's memory and has to be stored in the cloud. More specifically, assume that our computer has enough memory to hold 36 elements, for some constant b, but A has size n much greater than b. We can call read (X, i, B) to read a chunk of b elements from an array X (in the cloud) starting at index i into a local array B. Similarly, we can call write (C, X, i) to write a chunk of b elements stored in local array C to a cloud array X starting at index i. Here's a proposed (incomplete!) implementation of the merge operation that merges cloud arrays X and Y into cloud array Z. The code uses local arrays A, B, and C, each of size b, to cache X, Y, and Z. For simplicity, we assume that the input arrays X and Y have sizes a multiple of b, and that reading past the end of either X or Y returns values ∞ as in the studio. "mod" is the integer modulo operator (% in Java). MERGE(X, Y, Z) i +0 j+0 k +0 READ(X, 0, A) READ(Y, 0, B) while A[i mod b] <∞ or B[j mod b] < ∞ do u ← A[i mod b] v← B[j mod b] C[k mod b] = min(u, v) if u
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE:
The implementation of a queue in an array, as given in this chapter, uses the variable count to...
Related questions
Question
10, 11, 12
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
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.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning