Assume the input is a Singly Linked Positional List (SLPL), similar to what was discussed in class. Your algorithm has to perform the shuffle in-place.
Which of the following algorithms is most suitable for performing an in-place shuffle of elements in a singly linked positional list?
A) Merge Sort
B) Quick Sort
C) Bubble Sort
D) Selection Sort