Introduction to Computer Applications
Introduction to Computer Applications
UNIT V – Algorithms
Definition
An algorithm is a finite sequence of well-defined steps to solve a particular
problem.
Types of Algorithms
Searching Algorithms:
o Linear Search: Sequential check.
o Binary Search: Divides array and searches.
Sorting Algorithms:
o Bubble Sort: Repeated swapping.
o Merge Sort: Divide and conquer approach.
Recursive Algorithms: Function calls itself to solve subproblems.
Uses of Algorithms
Programming
Data analysis
Automation tasks
Characteristics of Good Algorithm
Finiteness: Ends after a finite number of steps.
Definiteness: Clear and unambiguous.
Input: Takes input values.
Output: Produces desired result.
Effectiveness: Basic and feasible steps.
Symbols & Implications in Flowcharts
Start/End: Oval shape.
Process: Rectangle.
Decision: Diamond.
Input/Output: Parallelogram.