Fermat's Test for Prime Numbers 🔍 | Easy Algorithm Explained

Design techniques:

0. Introduction to Algorithm : https://youtu.be/1EWjNHCMbe4
1. Introduction to Greedy Method: https://youtu.be/EmDQpt8hb_g
2. Fractional Knapsack: https://youtu.be/pU_FslQtbb8
3. Job Sequencing: https://youtu.be/S1vjZj1fE6A
4. Dynamic Programming and 0/1 Knapsack: https://youtu.be/BIKxLs6Y54g
5. Optimal Binary Search Tree (OBST): https://youtu.be/22C6rQemeCQ
6. Example of OBST: https://youtu.be/4zZGqUao0tU
7. Backtracking: https://youtu.be/UsAzMzuKEFw
8. Branch and Bound: https://youtu.be/DSgsl1AHGCE

Complexity and Recurrence:
1. Time and Space Complexity: https://youtu.be/vwcjyHTAB5s
2. Time and Space Complexity Examples: https://youtu.be/M0oeUTW5ZW4
3. Asymptotic Notations: https://youtu.be/WwEuQvuv61A
4. Average Case, Best Case and Worst Case Complexity: https://youtu.be/DAVvI1_92uY, https://youtu.be/UubjHePMrk0
5. Why analysis of Algorithms is done: https://youtu.be/TxhoiqnL8Jc
6. Complexity of Tower of Hanoi using Substitution: https://youtu.be/4eG4PaLSqtk
7. Complexity of Tower of Hanoi using Recursion Tree: https://youtu.be/7mlhOWzYBMs
8. Complexity of Mergesort: https://youtu.be/Vb9_feNcufY


Prime Numbers Algorithms:
1. Prime Numbers: https://youtu.be/xEo9J27SDEk
2. Sieve of Eratosthene: https://youtu.be/UvVczRm2bQg
3: Sieve of Sundaram: https://youtu.be/GOPPPsU-z0M
4. Sieve of Atkin: https://youtu.be/7mfxPOJdnnI
5. Fermat's Test: https://youtu.be/JfD8iKfxbRk