Problem $4$: Now You're Doing The CS Student Shuffle

We'll start with another question from pedagogical programming's great canon: the list

shuffle.

$1.$ The first, shuffle$\_$create$(),$ will accept one list parameter and return a new

list with the same elements from the list that was passed in$,$ but shuffled in any

random order.

$2.$ The second, shuffle$\_$in$\_$place$(),$ will accept one list parameter and shuffle

its elements in$-$place $($that is$,$ it does not create a new list$)$ in any random order.

See the sample behavior below:

def main$()$:

list$\_$one $=["$Jean Valjean", "Javert", "Fantine", "Cosette", "Marius Pontmercy",

"Eponine", "Enjolras"$]$

print$("$ORIGINAL LIST$\_$ONE: $\{\}".$format$($list$\_$one$))$

# First function execution

print$("$LIST CREATED BY SHUFFLE$\_$CREATE: $\{\}$

$".$format$($shuffle$\_$create$($list$\_$one$)))$

list$\_$two $=["$A$",0,0,5,1,3,2]$

print$("$ORIGINAL LIST$\_$TWO: $\{\}".$format$($list$\_$two$))$

# Second function execution

shuffle$\_$in$\_$place$($list$\_$two$)$

print$("$LIST$\_$TWO AFTER SHUFFLE$\_$IN$\_$PLACE: $\{\}".$format$($list$\_$two$))$

main$()$

A possible output $($since the behavior is pseudo$-$random$)$:

ORIGINAL LIST$\_$ONE: $[\text{'}$Jean Valjean', 'Javert', 'Fantine',

'Cosette', 'Marius Pontmercy', 'Eponine', 'Enjolras'$]$

LIST CREATED BY SHUFFLE$\_$CREATE: $[\text{'}$Enjolras$\text{'},$ 'Fantine', 'Jean

Valjean', 'Eponine', 'Cosette', 'Javert', 'Marius Pontmercy'$]$

ORIGINAL LIST$\_$TWO: $[\text{'}$A$\text{'},0,0,5,1,3,2]$

LIST$\_$TWO AFTER SHUFFLE$\_$IN$\_$PLACE: $[0,1,2,\text{'}$A$\text{'},5,3,0]$

Some explanation as to what qualifies as a "shuffle" is probably in order. For

shuffle$\_$create, it may be worth considering the use of random and list functions,

such as randrange$/$randint$,$ pop, and append. That is$,$ taking elements randomly

from your original list, and adding them to your new list, which of course starts empty.

For shuffling in place, it's worth remembering what in$-$place actually means. We're not

creating a new list, but rather editing the original list. In other words, we're replacing the

element at index x with the element at index y$.$ Think about how to achieve this until

none of the elements from the original list are in the same place as they were before.

Restrictions

$$ You may not use the shuffle method from the random module

$$ You may not use the sample method