Algorithm Presentation Semester 1
Algorithm Presentation Semester 1
• What is Algorithm?
• A process or set of rules to be
followed in calculations or
other problem-solving
operations, especially by a
computer.
ALGORITHM
HISTORY
• 1843:Adalovelace
• 1926:Term “Algorithm”
• 1950:Weather Prediction
• 1999:Google’s Algorithm
TYPES
• Brute Force Algorithm
• Recursive Algorithm
• Randomized Algorithm
• Sorting Algorithm
• Searching Algorithm
REPRESENTATION
NATURAL LANGUAGE
Algorithms can be described
in plain, everyday language
• Step 1: Start
• Step 2: Take input two numbers
• Step 3:Add the two numbers
• Step 4:Display two numbers
• Step 5:End
A structured, language-independent
way to write algorithms, focusing on
logic rather than syntax.
PSEUDOCODE
PROGRAMMMING CODE
The algorithm is directly implemented
in a programming language.
A graphical representation
using symbols like rectangles
(process), diamonds (decision points),
and arrows (flow direction).
FLOW CHART
DISCOVERY OF ALGORITHM
Understand Problem
• Clearly define the problem: What exactly needs to be solved?
• Input and Output: Identify what inputs are given and what
outputs are expected.
• Example: For sorting numbers, the input is an unsorted list, and
the output is the same list sorted in ascending or descending
order.
• Divide the problem into smaller tasks:
Each task should be simpler to handle.
• Example: For sorting, tasks can be
comparing two numbers, swapping them,
and repeating the process.