fixed TimSort algorithm bug

[idomeisner]

There is a problem with the TimSort algorithm as described here: fix #180

The problem is that in several places there was an unnecessary indentation.

for example:

    while n >= RUN_LEN:
        last_bit |= n & 1
        n >>= 1
        return n + last_bit

instead of:

    while n >= RUN_LEN:
        last_bit |= n & 1
        n >>= 1
    return n + last_bit

Things I also did:

• There was a mix between tabs and spaces in the timSort.py, so I aligned it all to spaces.
• I improved a little the timSort.py/merge function.
• The function binary_search was taking an extra argument that is not been used so I removed it.
• Changed array[0:len(array)] to array[:].
• Removed the redundant variable current_alg from main.py.
• Improved a little the structure of an if condition in display.py.