def rbt_bm(): n = 100000 a1 = [random.randint(0, 999999) for x in xrange(0, n)] a2 = [random.randint(0, 999999) for x in xrange(0, n)] start = time.time() tree = RedBlackTree() for i in xrange(0, n): tree.add(i) for i in xrange(0, n): tree.delete(tree.root) tree = RedBlackTree() for x in a1: tree.add(x) for x in a2: tree.search(x) for key in tree.inorder_walk(): key + 1 for key in tree.reverse_inorder_walk(): key + 1 for i in xrange(0, n): tree.maximum() for i in xrange(0, n): tree.minimum() return time.time() - start
def rbt_bm(): n = 10000 a1 = [random.randint(0, 999999) for x in xrange(0, n)] a2 = [random.randint(0, 999999) for x in xrange(0, n)] start = time.time() tree = RedBlackTree() for i in xrange(0, n): tree.add(i) for i in xrange(0, n): tree.delete(tree.root) tree = RedBlackTree() for x in a1: tree.add(x) for x in a2: tree.search(x) for key in tree.inorder_walk(): key + 1 for key in tree.reverse_inorder_walk(): key + 1 for i in xrange(0, n): tree.maximum() for i in xrange(0, n): tree.minimum() return time.time() - start
def bm(arr): start = time.time() tree = RedBlackTree() for x in arr: tree.add(x) return time.time() - start