insertion_sort, rotate matrix, dfs

Coding Test/dfs.py

@@ -9,25 +9,29 @@
 }
 
 discovered = []
+
+
 def recursive_dfs_global(v):
     global discovered
     discovered.append(v)
-    
+
     for next in graph[v]:
         if next not in discovered:
             discovered = recursive_dfs_global(next)
-            
+
     return discovered
 
-def recursive_dfs_local(v, discovered = []):
+
+def recursive_dfs_local(v, discovered=[]):
     discovered.append(v)
-    
+
     for next in graph[v]:
         if next not in discovered:
             discovered = recursive_dfs_local(next, discovered)
-            
+
     return discovered
 
+
 def stack_dfs(start):
     stack = [start]
     discovered = []
@@ -37,14 +41,31 @@ def stack_dfs(start):
             discovered.append(v)
             for next in graph[v]:
                 stack.append(next)
-            
+
     return discovered
-
-
 
-print(recursive_dfs_local(1))
-print(stack_dfs(1))
+
+# print(recursive_dfs_local(1))
+# print(stack_dfs(1))
 
 
 # [1, 2, 5, 6, 7, 3, 4]
-# [1, 4, 3, 5, 7, 6, 2]
+# [1, 4, 3, 5, 7, 6, 2]
+
+
+def stack_dfss(v):
+    stack = [v]
+    discovered = []
+
+    while stack:
+        top = stack.pop()
+
+        if top not in discovered:
+            discovered.append(top)
+            for next in graph[top]:
+                stack.append(next)
+
+    return discovered
+
+
+print(stack_dfss(1))

Coding Test/insertion_sort.py

@@ -0,0 +1,24 @@
+import re
+import collections
+import itertools
+import heapq
+import bisect
+import sys
+import functools
+
+A = [5,4,3,2,1]
+
+def insertion_sort(arr):
+    i = 1
+    while i < len(arr):
+        j = i
+        while j > 0 and arr[j-1] > arr[j]:
+            arr[j-1], arr[j] = arr[j], arr[j-1]
+            j -= 1
+        i += 1
+
+
+
+insertion_sort(A)
+
+print(A)

rotate_matrix.py

@@ -0,0 +1,17 @@
+import copy
+matrix = [[1,2,3], [4,5,6],[7,8,9]]
+
+col = len(matrix[0])
+new_matrix = [[0] * col for x in matrix]
+
+for i in range(len(matrix)):
+    for j in range(len(matrix[0])):
+        new_matrix[i][j] = matrix[col-j-1][i]
+matrix = new_matrix[:]
+
+for i in range(len(matrix)):
+    for j in range(len(matrix[0])):
+        new_matrix[i][j] = matrix[col-j-1][i]
+
+
+print(new_matrix)