- Recursion
-
Head tail
-
Reverse Strings
*
♣
-
Palindrome
*
-
Permutations
*
-
Combinations
*
-
Reverse Strings
*
♣
- Optimization
- Divide conquer
Head Tail ♣ Reverse Strings
A classic recursive algorithm. The iterative solution is better. recursive(str[1:]) + str[0] # tail+head s += str[len(str) - i] # iterative
b1