0% found this document useful (0 votes)
10 views1 page

Algorithm

Uploaded by

Vishal Kushwaha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views1 page

Algorithm

Uploaded by

Vishal Kushwaha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Algorithms: It is a set of rules that must be followed when solving a particular problem.

The
Algorithms are used to design the solution of any Problem. An algorithm is a finite sequence of
instructions for performing a task. A flowchart is a graphical representation of an algorithm.

It must have the following characteristics:


o Clear and Unambiguous: Algorithm should be clear and unambiguous. Each of its
steps should be clear in all aspects and must lead to only one meaning.

o Well-Defined Inputs: If an algorithm says to take inputs, it should be well-defined


inputs.
o Well-Defined Outputs: The algorithm must clearly define what output will be yielded
and it should be well-defined as well.
o Finiteness: The algorithm must be finite, i.e. it should not end up in an infinite loops or
similar.
o Feasible: The algorithm must be simple, generic and practical, such that it can be
executed upon with the available resources.
o Language Independent: The Algorithm designed must be language-independent.

✓ How to Design an Algorithm?


Step 1: Fulfilling the pre-requisites
Step 2: Designing the algorithm
Many Design techniques are available to design the algorithm for any problem as per nature of
problem. Some popular techniques are Divide and Conquer Techniques, Greedy approach,
Dynamic Programming, Back Tracking, Branch and Bound Techniques.
Step 3: Testing the algorithm by implementing it.

✓ Analysis of algorithm is the process of analyzing the problem-solving capability of the


algorithm in terms of the time and size required. Time Complexity & Space Complexity

You might also like