Recursion Benchmark

sneekula 0 Tallied Votes 229 Views Share

If you own a stopwatch, here is your chance to benchmark the various versions of Python on recursion performance. The Ackermann function gives the old computer quite a workout.

The Ackermann function, due to its extremely deep recursion, can be
used as a benchmark of a 'compiler's' ability to optimize recursion.

import sys

def ack(m, n):
    # count recursions
    global recursion_count
    recursion_count += 1
    if recursion_count % 10000000 == 0:
        print( "now %s recursions" % recursion_count )
    if m == 0:
        return n+1
    elif n == 0:
        return ack(m-1, 1)
        return ack(m-1, ack(m, n-1))

recursion_count = 1
print('start (use a stop watch to time each 10,000,000 recursions)')

# don't wait for the result if you are impatient
print( ack(4, 1) )
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.