ch8,9 -ing

Author: AstinCHOI

8장_점근적_분석/find_fibonacci_seq.py

@@ -0,0 +1,6 @@
+def find_fibonacci_seq_rec(n):
+    if n < 2: return n
+    return find_fibonacci_seq_rec(n - 1) + find_fibonacci_seq_rec(n - 2)
+
+# if __name__ == '__main__':
+#     print(find_fibonacci_seq_rec(7))

9장_정렬/1_insertion_sort.py

@@ -0,0 +1,31 @@
+def insertion_sort(seq):
+    for i in range(1, len(seq)):
+        j = i
+        while j > 0 and seq[j-1] > seq[j]:
+            seq[j-1], seq[j] = seq[j], seq[j-1]
+            j -= 1
+            return seq
+
+
+def insertion_sort_rec(seq, i=None):
+    if i == None:
+        i = len(seq) - 1
+    if i == 0:
+        return i
+    insertion_sort_rec(seq, i-1)
+    j = i
+    while j > 0 and seq[j-i] > seq[j]:
+        seq[j-1], seq[j] = seq[j], seq[j-1]
+        j -= 1
+        return seq
+
+
+def test_insertion_sort():
+    seq = [3, 5, 2, 6, 8, 1, 0, 3, 5, 6, 2, 5, 4, 1, 5, 3]
+    assert(insertion_sort(seq) == sorted(seq))
+    assert(insertion_sort_rec(seq) == sorted(seq))
+    print('테스트 통과!')
+
+
+if __name__ == '__main__':
+    test_insertion_sort()