[4] adding ll_list_all() and sort_list()

lukovnikovde/docs/data/DataStructure.py

@@ -47,9 +47,22 @@ def ll_delete(head, name):
     return head
     
 
-                
-    
+def ll_list_all(head):
+    name_list = []
+    running = head
+    while running is not None:
+        name_list.append([running['name'], running['phone']])     
+        running = running['next']
+    return name_list
 
+def sort_list(name_list):
+    l = len(name_list)
+    for i in range(l - 1):
+        for j in range(l - i - 1):
+            if name_list[j][0] > name_list[j + 1][0]:
+                name_list[j][0], name_list[j + 1][0] = name_list[j + 1][0], name_list[j][0]
+    return name_list
+ 
 
 def main():
 
@@ -76,6 +89,10 @@ def main():
         print(name, ":", ll_find(head, name))
     print("======== END TESTING =============")
 
+    print("============ TESTING LL_LIST_ALL  AND SORT_LIST =============")
+    print(*sort_list(ll_list_all(head)))
+    print("============ END TESTING ===============")
+
     print('========== TESTING LL_DELETE ==========')
     
     for _ in range(2):
@@ -86,6 +103,11 @@ def main():
         print(name, ":", ll_find(head, name))
     print("========= END TESTING ==============")
 
+
+
+
+
+
 if __name__ == "__main__":
     main()