Continuing from last week’s article on recursion limits, today we’ll talk about recursion speed. Is there a penalty for making recursive calls? Does it increase as the recursion gets deeper and deeper? Read on to find out.

# Archive for November, 2010

### Recursion Part 1: Limits

Nov 22

Recursion is a commonly-used feature of many programming languages, including AS3. It’s useful for everything from trivial examples like computing the Fibonacci sequence all the way up to advanced sorting techniques like Quicksort and tree algorithms. This article is a first in a series all about recursion. Today we’ll see what kinds of limits the Flash Player puts on us as recursion-using AS3 developers.

### Implicit Type Conversion

Nov 15

I’ve talked before about *explicit* type conversion and used the function-call style (`Type(obj)`

) and the `as`

keyword to accomplish the task. Today, I’m going to talk about *implicit* type conversion and use—as implicit would imply—no operators at all!

### Calling Functions

Nov 8

There are actually three ways to call a function in AS3. Can you name all three? Do you know which is fastest? Does the type of function being called matter? Today I’ll tackle these questions and find some surprising facts about the three ways to call a function in AS3.

### The Const Keyword

Nov 1