Scribd
Upload
3 views9 pages

Algorthms

An algorithm is a detailed, unambiguous, and ordered set of instructions designed to solve a specific problem. Key properties include finiteness, clarity, sequence, and effectiveness, with various representation techniques such as flowcharts and pseudocode. The goal is to provide a clear step-by-step solution that can be understood by programmers and business professionals alike.

Uploaded by

susebstein
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
3 views9 pages

Algorthms

An algorithm is a detailed, unambiguous, and ordered set of instructions designed to solve a specific problem. Key properties include finiteness, clarity, sequence, and effectiveness, with various representation techniques such as flowcharts and pseudocode. The goal is to provide a clear step-by-step solution that can be understood by programmers and business professionals alike.

Uploaded by

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

Algorithms

Objectives

– What is an Algorithm.

– How to write an algorithm


Algorithm?

– An algorithm lists the steps involved in accomplishing a task that should come
after the problem has been thoroughly analyzed and solution outlined.
– It can be defined in programming terms as :
a. a set of detailed,
b. unambiguous and
c. ordered instructions,
developed to describe the processes necessary to produce the desired output from a
given input.
– an algorithm is a step-by-step procedure to solve a given problem
What is an Algorithm?

– An algorithm must:
– be lucid, precise, and unambiguous
– give the correct solution in all cases
– eventually end(Have finite steps)

– It is important to use indentation when writing solution algorithms


because it helps to differentiate between the three control
structures
Properties of Algorithms

– Finiteness
– It has to finish at some point
– An algorithm must terminate in a finite number of steps
– Absence of ambiguity
– Only one interpretation
– Sequence
– Need to know the order of execution
– Input/output
– 0 or more inputs and at least 1 output
– Effectiveness
– Must be capable of performing each step
– Each step must be effective, in the sense that it should be primitive (easily convertible
into program statement) can be performed exactly in a finite amount of time.
Algorithms are independent of
any language
Problem

Algorithm
Algorithm
Representation
− There are many ways in which we may represent an
algorithm;
− We use many techniques to represent an algorithm
in computer programming. The techniques that will
study are:
− Flowchart – Using symbols
− Pseudocode – Using English like code
Conclusion

– Algorithms give the outlined solution step by step in the for of pseudocode or a
flowchart
– It is written for different programmers and other business people so it must be
as clear as possible.
The End

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy