This document discusses algorithm design and provides information on various algorithm design techniques. It begins with definitions of an algorithm and algorithm design. It then discusses the importance of algorithm design and some common algorithm design techniques including dynamic programming, graph algorithms, divide and conquer, backtracking, greedy algorithms, and using flowcharts. It also provides brief descriptions and examples of each technique. The document concludes by listing some advantages of designing algorithms such as ease of use, performance, scalability, and stability.

1. Algorithm Design
Presented by :
1. Sumaiya Afrin Tusha 2.Methila Biswas
Raya
3. Mahin Sharmin 4. Lamyea Akhter
Nowrin

2. Algorithm Design
What is Algorithm ?
What is Algorithm Design ?
Importance of Algorithm Design
How to Design an Algorithm ?
Advantages of designing an Algorithm

3. What is Algorithm ?
An algorithm (pronounced AL-go-rith-um)
is a procedure or formula for
solving a problem.

4. What is Algorithm Design ?
It is a specific method to create a
mathematical process in solving
problems .

5. Importance of Algorithm
Design
It is important because it allows for
analysis on different ways to compute
things and ultimately come up with the
best way to solve a particular
problems .

6. How to Design an Algorithm ?
For making a design of algorithm we
need a technique of :
Dynamic programming
 Graph algorithms
 Divide and conquer
 Back tracking
 Greedy Algorithm
 Flow chart

7. Dynamic Programming
The dynamic programming is a
paradigm of algorithm design in which
an optimization problem is solved by a
combination of caching subproblem
solutions and appealing to the
"principle of optimality."

8. Basic Elements of Dynamic
Programming
1. Substructure
2. Table-Structure
3. Bottom-up Computation

9. Graph Algorithm
A graph algorithm is an algorithm that
takes more graph as input .

10. Types of Graph algorithm
 Directed graph
 Undirected graph

11. Divide and Conquer
The divide-and-conquer strategy
solves a Problem by :
1.Breaking it into subproblems that are
themselves smaller instances of the
same type of problem
2.Recursively solving these
3. Appropriately combining their
answers

12. Unsorted sequence
Sorted sequence

13. Back Tracking
Backtracking is a general algorithm
for finding all (or some) solutions to
some computational problem.

14. Greedy Algorithm
1.What is greedy algorithm ?
2. Components of greedy algorithm
 Candidate Set
 Selection Function
 Feasibility Function
 Objective Function
 Solution Function
3.Drawback

15. Flowchart
A flowchart is a type of diagram that
represents algorithm , workflow or
process, showing the steps as boxes
of various kinds, and their order by
connecting them with arrows.

17. Advantages of designing
Algorithm
 Ease of use
 Performance
 Scalability
 Stability

18. Thank You