• A data structure is a logical method of representing data in memory.
• Data structure is strictly described as an instance of an Abstract Data Type (ADT).
• An Abstract Data Type is defined as a mathematical model of a user-defined type along with the operations performed on that model.

Algorithm

An algorithm can be described as sequence of steps or instructions required to solve a given problem.

It is a finite set of instructions written to accomplish a particular task.

When designing an algorithm, one must ensure that the

algorithm adheres to the following criteria:

Input: Some input data (can be empty in some cases) externally supplied to the algorithm

Output: At least one output is produced

Finiteness: The algorithm must terminate after finite number of steps

Definiteness: The instructions must be clear and unambiguous

Effectiveness: Every instruction must be basic enough to be carried out on paper

Following are certain points to be considered

while writing an algorithm :

Representing an algorithm.

Designing an algorithm.

Analyzing an algorithm.

Algorithm Analysis

Algorithm Analysis involves comparing different algorithms written for a specific problem. All the algorithms are compared for their space and time complexities.

Space complexity: It refers to the amount of storage the algorithm consumes.

Time complexity: It is the time required by the algorithm for execution.

Following are the different types of time complexities:

Best-case time complexity: It is the measure of minimum time required for an algorithm to execute for a known input size.

Average case time complexity: Average time complexity is the measure of time an algorithm will require to execute, for a typical input data size. This method requires statistical calculations.

Worst-case time complexity: It is the measure of maximum time required for an algorithm to execute for a known input size.

The post Data structure and algorithm appeared first on .

• Statements in algorithms clearly explain the action that is to be performed by that step.
• The steps have to be short and precise.
• Collection of these steps, helps solve the problem.

Two different individuals can write two different algorithms to achieve the same result.

Algorithm to add two numbers.
======================
1. Accept two [a & b] values from the user.
2. Compute [c=a+b]
3. Display the sum[c].

Flowchart:- Pictorial representation of the approach to solving a problem, with use of standard set of symbols, is a Flow Chart.

As a picture speaks better than words, drawing a diagram will help the user understand the solution easily.
The Flow chart can also help the user to understand the correct flow of actions and steps to follow.

Flow chart uses a standard set of symbols.

• Rectangles for processing
• Diamond shapes for decision making
• The symbols are accepted and understood uniformly by all the programmers in the world.
• Connectors are used to link flow charts that are in multiple pages.
• Any flow chart always has a START and STOP.

The post Algorithm and Flowchart appeared first on .