Question

Which statement about the algorithm we presented in Section 7. of the text for shuffling a deck of cards is true?
a) It's guaranteed to terminate.
b) It could execute indefinitely.
c) It's efficient.
d) It uses a one-dimensional array of 52 cards.

Answer

This answer is hidden. It contains 3 characters.