MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

def countingSort(A, k):
	""" 
	    Implementation of counting sort. 
	    @param A: the list of integers which should get sorted. 
			No element should be smaller than 1
	    @param k: the highest number in A
	"""

MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

from math import log, ceil

import matplotlib.pyplot as plt
import numpy as np
import matplotlib.mlab as mlab

try:

MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

""" How multiplication works """

def simple(a, b):
	""" Multiplication you've learned at school """
	additions = 0
	multiplications = 0
	product = 0

MartinThoma

#include <iostream>
#include <vector>
#include <iterator>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

#define DIRECTED true
#define MULTIPLE_EDGES false

MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

comparisons = 0
switches = 0
calls = 0

def read(filename):
	lines = open(filename, 'r').read().splitlines()
	return map(int, lines)

MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

def choleskyDecomposition(A):
    """ 
        @param A: a nested list which represents a symmetric,
				  positiv definit n x n matrix.
        @return: False if it didn't work, otherwise the matrix G
    """
    n = len(A)

MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

def choleskyBanachiewicz(A):
    """ 
        @param A: a nested list which represents a symmetric,
				  positiv definit n x n matrix.
        @return: False if it didn't work, otherwise the matrix G
    """
    n = len(A)

MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

def getBinary(number, bits):
    """ Takes a number and a number of bits and returns a True-False
        representation of the number with bits bits.
        @param number: The number you want to convert
        @param bits: The number of bits
        @return a list of True / False values
    """

MartinThoma

import bisect
import itertools
import operator

class _BNode(object):
    __slots__ = ["tree", "contents", "children"]

    def __init__(self, tree, contents=None, children=None):
        self.tree = tree
        self.contents = contents or []

MartinThoma

#!/usr/bin/python
# -*- coding: utf-8 -*-

""" 
    This script shows that addition and multiplication is similar 
    in terms of execution speed.
"""

import random, datetime