Recursion

• itoa.cpp Simple integer-to-string conversion (order N ).

• pow1.cpp Integer power calculation -- incrementally recursive implementation (order N ).
• pow2.cpp Integer power calculation -- inefficient divide-and-conquer implementation (order N ).
• pow3.cpp Integer power calculation -- efficient divide-and-conquer implementation (order log N ).
• itPow.cpp Integer power calculation -- efficient iterative (loop-based) order-log N implementation.
• itBitPow.cpp Integer power calculation -- efficient order-log N implementation with explicit bit-shift operations.

• recBinarySearch.cpp Binary Search -- syntactically recursive implementation (order log N ).
• itBinarySearch.cpp Binary Search -- iterative implementation (order log N ).

• mergesort.cpp Merge sort. Pointer-based implementation with dynamically allocated arrays (order N log N ).

• enumPerm1.cpp Enumerating Permutations (order N! == N*(N-1)*(N-2)*...*1)
• enumPerm2.cpp Organizing Permutations (order N! == N*(N-1)*(N-2)*...*1)

• isPerm1.cpp Matching Permutations
• isPerm2.cpp Matching Permutations with trace (order N! == N*(N-1)*(N-2)*...*1)