docs: modify mutable.shuffle example code and Go Playground links

README.md

@@ -670,11 +670,14 @@ Returns an array of shuffled values. Uses the Fisher-Yates shuffle algorithm.
 ```go
 import lom "github.com/samber/lo/mutable"
 
-randomOrder := lom.Shuffle([]int{0, 1, 2, 3, 4, 5})
+list := []int{0, 1, 2, 3, 4, 5}
+lom.Shuffle(list)
+
+list
 // []int{1, 4, 0, 3, 5, 2}
 ```
 
-[[play](https://go.dev/play/p/ZTGG7OUCdnp)]
+[[play](https://go.dev/play/p/2xb3WdLjeSJ)]
 
 ### Reverse
 
@@ -692,7 +695,7 @@ list
 // []int{5, 4, 3, 2, 1, 0}
 ```
 
-[[play](https://go.dev/play/p/iv2e9jslfBM)]
+[[play](https://go.dev/play/p/O-M5pmCRgzV)]
 
 ### Fill
 

mutable/slice.go

@@ -3,15 +3,15 @@ package mutable
 import "github.com/samber/lo/internal/rand"
 
 // Shuffle returns an array of shuffled values. Uses the Fisher-Yates shuffle algorithm.
-// Play: https://go.dev/play/p/ZTGG7OUCdnp
+// Play: https://go.dev/play/p/2xb3WdLjeSJ
 func Shuffle[T any, Slice ~[]T](collection Slice) {
 	rand.Shuffle(len(collection), func(i, j int) {
 		collection[i], collection[j] = collection[j], collection[i]
 	})
 }
 
 // Reverse reverses array so that the first element becomes the last, the second element becomes the second to last, and so on.
-// Play: https://go.dev/play/p/iv2e9jslfBM
+// Play: https://go.dev/play/p/O-M5pmCRgzV
 func Reverse[T any, Slice ~[]T](collection Slice) {
 	length := len(collection)
 	half := length / 2