October 20, 2009 It is easy to shuffle an array by stepping
through the array, swapping each element with a forward element
(an element at an index greater than or equal to the current
element) until the next-to-last element is reached. It is harder
to shuffle a linked list, because lists don’t permit ready
access to any element other than the first. Your task is to
write functions that shuffle an array and a linked list. When
you are finished, you are welcome to read or run a suggested
solution, or to post your own solution or discuss the exercise
in the comments below. Pages: 1 2