diff --git a/subjects/listsort.en.md b/subjects/listsort.en.md
index 44ec9e2a..a9e5b8bf 100644
--- a/subjects/listsort.en.md
+++ b/subjects/listsort.en.md
@@ -6,10 +6,6 @@ Write a function `ListSort` that sorts the linked list by ascending order.
 
 - This time you only will have the `node` structure.
 
-- Try to use recursive.
-
-- Use pointers when ever you can.
-
 ### Expected function and structure
 
 ```go
@@ -37,13 +33,12 @@ import (
 )
 
 func PrintList(l *piscine.NodeI) {
-	m := l
-	for m != nil {
-		fmt.Print(m.Data, " -> ")
-		m = m.Next
+	it := l
+	for it != nil {
+		fmt.Print(it.Data, " -> ")
+		it = it.Next
 	}
-	fmt.Print(nil)
-	fmt.Println()
+	fmt.Print(nil, "\n")
 }
 
 func listPushBack(l *piscine.NodeI, data int) *piscine.NodeI {