Scribd
Upload
90 views17 pages

10-Importance of Algorithms and Data Structures - Fundamentals of Alg-Analy - Space and Time Complexity-03-08-2022

Algorithms and data structures are interrelated and important components of computer science, as algorithms apply to specific data structures to efficiently solve problems like searching, sorting, inserting, updating and deleting data. The document outlines the importance of algorithms and data structures, their relationship, major categories of algorithms, and the four stages of algorithm analysis and design - identifying the problem, designing a framework, analyzing efficiency, and implementing and testing the algorithm. It also discusses analyzing algorithms based on time and space complexity.

Uploaded by

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

10-Importance of Algorithms and Data Structures - Fundamentals of Alg-Analy - Space and Time Complexity-03-08-2022

Algorithms and data structures are interrelated and important components of computer science, as algorithms apply to specific data structures to efficiently solve problems like searching, sorting, inserting, updating and deleting data. The document outlines the importance of algorithms and data structures, their relationship, major categories of algorithms, and the four stages of algorithm analysis and design - identifying the problem, designing a framework, analyzing efficiency, and implementing and testing the algorithm. It also discusses analyzing algorithms based on time and space complexity.

Uploaded by

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

Overview and Importance of

Algorithms
Importance of algorithm
• Data structure is an orderly arrangement of
data in computers to use it in a more efficient
manner.

• It’s a collection of data objects that allows


storing, organizing, and retrieving data on
systems
• Both are interrelated components
• An algorithm appliers to a particular
data structure, while the right data
Relationship structure helps to drastically improve
between the performance of the algorithm
Data Major categories of algorithms in
relation to DS
Structure – Search
and – Insert
Algorithm – Sort
– Update
– Delete
Importance of Learning
DS and Algorithm

• Most pivotal topics for programmers and


computer science graduates.
• Reduces coding cost & enhances data
accuracy
• Improve problem solving abilities
• Expose to different problem-solving
techniques
• Competent in DS can resolve tasks related
to data processing, automated reasoning
or calculations
Various stages of algorithm
development for solving a
problem
1 2 3 4 5

The Four Design: The Analyze : Implement : Experiment:


Major Stages first stage is Once you Writing and coding Once the
of Algorithm to identify the have the basic the algorithm is the algorithm is
Analysis and problem and framework of next step in the designed and
Design thoroughly the algorithm process. To write coded go back
understand it. it's time to the algorithm and experiment
start analyzing efficiently you have with different
how efficient to know exactly variables in the
the code is in what each line of algorithm. Try
solving the code is going to with different
problem. accomplish when data to ensure
the program is correctness and
executed efficiency of the
algorithm.
Space and Time Complexity
• Space complexity : is the process of
determining a formula for prediction of how
much memory space will be required for the
successful execution of the algorithm.
• The memory space we generally consider is
the space of primary memory
• Time complexity is defined as the process of
determining a formula for total time required
towards execution of that algorithm.
• The calculation will be independent of
implementation details and programming
language.
How to analyze an algorithm
• Time
• Space
• Network
• Power
• CPU Registers
Analysis of algorithm
Algorithm swap ( A , B )
{
TIME SPACE
Temp = A;
A = B;
B= Temp;
}

You might also like