18Aug Recursive Logic
196 views
One of the most fascinating concepts I believe in programming is recursive logic (aside from reflection which I will be posting about soon, but I digress). Recursive operations are pieces of functionality that can execute themselves until a desired outcome is achieved. For example, what if you had a random number generator from 1-100 but did not want to include the number 17 if it was chosen? The function could check to see if the random number made was 17 and re-call itself to choose yet another number. Buiding on this idea, quicksorting is a programming methodology for reordering arrays based on value using recursive techniques. The concept partitions out pivots from an input array and recursively rearranged each partition until the entire array is sorted.
|
Author: Jonathan Dunlap Jonathan is an experienced software engineer, sole blogger of JADBOX, author of FlashMVC, humanitarian, and has contracted work for Microsoft, Coke, and Disney. |
