Experimenting with code.

jwasham · jwasham · commit 6d9ec78f8c5e · 2016-08-06T17:12:07.000-07:00
diff --git a/dynamic_programming/maximum_increasing_subsequence.py b/dynamic_programming/maximum_increasing_subsequence.py
@@ -0,0 +1,15 @@
+
+def longest_increasing_subsequence(sequence):
+    sequence_length = len(sequence)
+    T = [1 for i in range(sequence_length)]
+
+    for index_i in range(1, sequence_length):
+        for index_j in range(0, index_i):
+            if sequence[index_j] < sequence[index_i]:
+                T[index_i] = max(T[index_i], T[index_j] + 1)
+
+    return max(T)
+
+if __name__ == '__main__':
+    sequence = [1, 101, 10, 2, 3, 100, 4]
+    assert 4 == longest_increasing_subsequence(sequence)
diff --git a/experiments/data_types.py b/experiments/data_types.py
@@ -0,0 +1,33 @@
+import sys
+
+
+def print_info(i):
+    print("-------")
+    print(i)
+    print(id(i))
+    print(hex(id(i)))
+    print("size: ", sys.getsizeof(i))
+
+
+def main():
+    i = 123
+    print_info(i)
+
+    j = 124
+    print_info(j)
+
+    k = 123987938720370293750293523525235235235235
+    print_info(k)
+
+    a_list = []
+    print_info(a_list)
+
+    dictionary = {}
+    print_info(dictionary)
+
+    string = "hello"
+    print_info(string)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/experiments/deck.py b/experiments/deck.py
@@ -0,0 +1,29 @@
+import collections
+import random
+
+Card = collections.namedtuple('Card', ['rank', 'suit'])
+
+
+class Deck(object):
+    ranks = [str(i) for i in range(2, 11)] + list('JKQA')
+    suits = 'spades diamonds clubs hearts'.split()
+
+    def __init__(self):
+        self._cards = [Card(rank, suit) for rank in self.ranks
+                                        for suit in self.suits]
+
+    def __len__(self):
+        return len(self._cards)
+
+    def __getitem__(self, position):
+        return self._cards[position]
+
+
+def main():
+    deck = Deck()
+    # print(len(deck))
+    print(random.choice(deck))
+
+
+if __name__ == "__main__":
+    main()
