- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail ♣
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Recursion / Head Tail »
Head-tail is a classic recursion algorithm. To reverse a string we place the head behind tail. A permutation is a specific order of a set. To find permutations we select one element as the head.
What is the head-tail technique? How do we reverse a string? What is a permutation of a set {A,B,C}? How can we find the permutations of a set?
Click to Flip Card