sorry i couldnt get rid of the color. Apart from that would you mind going over this algorithm by line with a visual example such as having an array and drawing what happens at each line. maybe include cost of each line..

anymore pics feel free to ask

smu pie pe In UUWII UMU UC Uuupul pie. Computationally, each basic step takes constant time, since we are comparing just the two top cards. Since we perform at most basic steps, merging takes 0 time The following pseudocode implements the above idea, but with an additional twist that avoids having to check whether either pile is empty in each basic step. We place on the bottom of each pile a sentinel card, which contains a special value that we use to simplify our code. Here, we use oo as the sentinel value, so that whenever a card with is exposed, it cannot be the smaller card unless both piles have their sentinel cards exposed. But once that happens, all the nonsentinel cards have already been placed onto the output pile. Since we know in advance that exactly - P + 1 cards will be placed onto the output pile, we can stop once we have performed that many basic steps. MERGE(4.p.4.) 1 = 9-P+1 n2 = -9 let L[1... + 1) and R[I..N2 + 1] be new arrays for i = 1 ton Z[i] = AP + i - 1] for j = 1 to 12 R[j] = A[9 + i] L[n, + 1] = 0 R[N2 + 1] = 0 for k = p tor if Li