💙 7 Types of Algorithms
↳ Brute Force
↳ Recursive
↳ Divide & Conquer
↳ Greedy
↳ Dynamic
↳ Backtracking
↳ Randomised
⇩
↳ Brute Force
↳ Recursive
↳ Divide & Conquer
↳ Greedy
↳ Dynamic
↳ Backtracking
↳ Randomised
⇩
1️⃣ Brute Force Algorithm
✪ It is the most common type of algorithm. Every problem can be solved by brute force approach although generally not most effective.
✪ To design an optimal solution, we need to get a solution first at least and then it may be optimised.
✪ It is the most common type of algorithm. Every problem can be solved by brute force approach although generally not most effective.
✪ To design an optimal solution, we need to get a solution first at least and then it may be optimised.
2️⃣ Recursive Algorithm
✪ Recursion simply means calling itself to solve its subproblems.
Example: Factorial(n) = n * Factorial(n-1)
✪ Recursion simply means calling itself to solve its subproblems.
Example: Factorial(n) = n * Factorial(n-1)
3️⃣ Divide & Conquer Algorithm
✪ It divides the problems into subproblems and then solve each of them.
✪ Then it combines the results to form the solution of the given problems.
Example: Binary Search, Quick Sort, Merge Sort etc.
✪ It divides the problems into subproblems and then solve each of them.
✪ Then it combines the results to form the solution of the given problems.
Example: Binary Search, Quick Sort, Merge Sort etc.
4️⃣ Greedy Algorithm
✪ In this algorithm, a decision is made that is good at that point without considering the future.
✪ It means some local best is chosen and is considered as the global optimal.
Example: Prim's Algorithm, Job Scheduling Algorithm etc.
✪ In this algorithm, a decision is made that is good at that point without considering the future.
✪ It means some local best is chosen and is considered as the global optimal.
Example: Prim's Algorithm, Job Scheduling Algorithm etc.
5️⃣ Dynamic Algorithm
✪ It remembers the past results and apply it to the future corresponding results.
✪ There are 2 approaches to solve
↳ Bottom-Up Approach
↳ Top-Down Approach
Example: Longest Common Subsequence etc.
✪ It remembers the past results and apply it to the future corresponding results.
✪ There are 2 approaches to solve
↳ Bottom-Up Approach
↳ Top-Down Approach
Example: Longest Common Subsequence etc.
6️⃣ Backtracking Algorithm
✪ It starts with one possible option out of many available and try to solve the problem.
✪ If it can't solve the problem, it will backtrack and select some other and try to solve it.
✪ It is a form of recursion.
Example: N-Queens Problem etc.
✪ It starts with one possible option out of many available and try to solve the problem.
✪ If it can't solve the problem, it will backtrack and select some other and try to solve it.
✪ It is a form of recursion.
Example: N-Queens Problem etc.
7️⃣ Randomised Algorithm
✪ In this type of algorithm, decision is taken based on the basis of random numbers.
✪ Probability plays the most significant role in this algorithm.
Example: Randomised Quick Sort etc.
✪ In this type of algorithm, decision is taken based on the basis of random numbers.
✪ Probability plays the most significant role in this algorithm.
Example: Randomised Quick Sort etc.
These are some of the most used algorithm types and with this we come to the end of this 🧵
As you could see, it's just an introductory. Each of these algorithm types will be explained in detail in my future blogs.
Details will be provided here soon. Stay Tuned. 👋
As you could see, it's just an introductory. Each of these algorithm types will be explained in detail in my future blogs.
Details will be provided here soon. Stay Tuned. 👋
To encourage and support me,
♥️ Like the first tween in this 🧵
🔁 RETWEET the first tweet
To never miss any content from me,
✅ Follow @swapnakpanda
🔔 Turn on Notifications
To give feedbacks and suggestions,
💬 Reply
♥️ Like the first tween in this 🧵
🔁 RETWEET the first tweet
To never miss any content from me,
✅ Follow @swapnakpanda
🔔 Turn on Notifications
To give feedbacks and suggestions,
💬 Reply
https://twitter.com/swapnakpanda/status/1465312942014959619
• • •
Missing some Tweet in this thread? You can try to
force a refresh
