- 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
Algorithms
Machine Learning
Recursion / Iterative Approach »
Iteration is faster and more efficient than recursion. Exponents are calcultated by multiplying a number by itself. Factorial is the product of n with every number less than n. Permutation is computed by calculating factorial. In fibonacci sequence every number is the sum of previous two.
Which one is preferred, recursion or iteration? How are exponents computed? How are factorial calculated? How can you compute the permutation number? How do you get the fibonacci sequence?
Click to Flip Card
