merge_sort is_sorted

Tp09/merge_sort.py

@@ -125,7 +125,24 @@ def is_sorted(l: ApLst, comp: Callable[[T, T], int]=compare) -> bool:
     $$$ is_sorted(native_to_list([1, 2, 4, 3]))
     False
     """
-    ...
+    if l.is_empty():
+        return True
+
+    current = l.head()
+    rest = l.tail()
+
+    while not rest.is_empty():
+        next_element = rest.head()
+        if comp(current, next_element) > 0:
+            return False
+        current = next_element
+        rest = rest.tail()
+
+    return True
+#     compteur = 0
+#     while not l.is_empty and l.comp(l.head(), is_sorted(l.tail()) == -1):
+#         compteur = compteur + 1
+#     return compteur == length(l)
 
 
 def split(l: ApLst) -> tuple[ApLst, ApLst]: