(Card Shuffling and Dealing Modification)In the card shuffling and dealing program of Fig....

(Card Shuffling and Dealing Modification)In the card shuffling and dealing program of Fig. 1, we intentionally used an inefficient shuffling algorithm that introduced the possibility of indefinite postponement. In this problem, you’ll create a high-performance shuffling algorithm that avoids indefinite postponement.

Modify the program of Fig. 1 as follows. Begin by initializing the deck array as shown in Fig. 2. Modify the shuffle function to loop row-by-row and column-by-column through the array, touching every element once. Each element should be swapped with a randomly selected element of the array. Print the resulting array to determine whether the deck is satisfactorily shuffled (as in Fig3, for example). You may want your program to call the shuffle function several times to ensure a satisfactory shuffle.

Figure 1 Card shuffling and dealing.

Figure 2 Unshuffled deck array.

Figure 3 Sample shuffled deck array.

Although the approach in this problem improves the shuffling algorithm, the dealing algorithm still requires searching the deck array for card 1, then card 2, then card 3, and so on. Worse yet, even after the dealing algorithm locates and deals the card, the algorithm still searches through the remainder of the deck. Modify the program of Fig. 1 so that once a card is dealt, no further attempts are made to match that card number, and the program immediately proceeds with dealing the next card. In Chapter 10, we develop a dealing algorithm that requires only one operation per card.