Courses Tutorials DSA Data Science Web Tech Sign In

DSA Algorithms Analysis of Algorithms Sorting Searching Greedy Recursion Backtracking Dynamic Programming

Next Article: Algorithms Tutorial

Competitive Last Updated : 26 Nov, 2024
Programming
- A Complete
Algorithm is a step-by-step procedure
Guide
for solving a problem or accomplishing
a task. In the context of data structures
and algorithms, it is a set of well-
defined instructions for performing a
specific computational task.
Algorithms are fundamental to
computer science and play a very
important role in designing efficient
solutions for various problems.
Understanding algorithms is essential
for anyone interested in mastering
data structures and algorithms.

What is an Algorithm?
An algorithm is a finite sequence of
well-defined instructions that can be
used
We use cookies to ensure tothe best
you have solve a experience
browsing computational
on our website. By using our site, you acknowledge that you have read and understo

problem. It provides a step-by-step

procedure that convert an input into a
desired output.

Algorithms typically follow a logical

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 1 of 12
:
 structure:

Input: The algorithm receives input

data.
Processing: The algorithm
performs a series of operations on
the input data.
Output: The algorithm produces
the desired output.

What is the Need for

Algorithms?
Algorithms are essential for solving
complex computational problems
efficiently and effectively. They
provide a systematic approach to:

Solving problems: Algorithms

break down problems into smaller,
manageable steps.
Optimizing solutions: Algorithms
find the best or near-optimal
solutions to problems.
Automating tasks: Algorithms can
automate repetitive or complex
tasks, saving time and effort.

1. Analysis of Algorithms
Analysis of Algorithms is the process
of evaluating the efficiency of
algorithms, focusing mainly on the
time and space complexity. This helps
in evaluating how the algorithm's
running time or space requirements
grow as the size of input increases.

Analysis of Algorithms Guide

Quiz on Analysis of Algorithms

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 2 of 12
:
 2. Mathematical Algorithms
Mathematical algorithms are used for
analyzing and optimizing data
structures and algorithms. Knowing
basic concepts
like divisibility, LCM, GCD, etc. can
really help you understand how data
structures work and improve your
ability to design efficient algorithms.

Mathematical Algorithms Guide

Practice Problems on Mathematical
Algorithms

3. Bitwise Algorithms
Bitwise algorithms are algorithms
that operate on individual bits of
numbers. These algorithms
manipulate the binary representation
of numbers like shifting
bits, setting or clearing specific
bits of a number and perform bitwise
operations (AND, OR, XOR). Bitwise
algorithms are commonly used in low-
level programming, cryptography,
and optimization tasks where efficient
manipulation of individual bits is
required.

Bitwise Algorithms Guide

Practice Problems on Bit Magic
Quiz on Bitwise Algorithms

4. Searching Algorithms
Searching Algorithms are used to find
a specific element or item in a
collection of data. These algorithms

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 3 of 12
:
 are widely used to retrieve data
efficiently from large datasets.

Guide on Searching Algorithms

Practice Problems on Searching
Top Searching Interview Questions
and Problems
Quiz on Searching Algorithms

5. Sorting Algorithms
Sorting algorithms are used
to arrange the elements of a list in
a specific order, such as numerical or
alphabetical. It organizes the items in a
systematic way, making it easier to
search for and access specific
elements.

Guide on Sorting Algorithms

Practice problems on Sorting
algorithm
Top Sorting Interview Questions
and Problems
Quiz on Sorting Algorithms

6. Recursion
Recursion is a programming technique
where a function calls itself within its
own definition. It is usually used to
solve problems that can be broken
down into smaller instances of the
same problem.

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 4 of 12
:
 Guide on Recursive Algorithms
Practice Problems on Recursion
algorithm
Top 50 Problems on Recursion
Algorithm for Interview
Quiz on Recursion

7. Backtracking Algorithm
Backtracking Algorithm is derived
from the Recursion algorithm, with the
option to revert if a recursive solution
fails, i.e. in case a solution fails, the
program traces back to the moment
where it failed and builds on another
solution. So basically it tries out all the
possible solutions and finds the
correct one.

Guide on Backtracking Algorithms

Practice Problems on Backtracking
algorithm
Top 20 Backtracking Algorithm
Interview Questions
Quiz on Backtracking Algorithm

8. Divide and Conquer

Algorithm
Divide and conquer algorithms follow
a recursive strategy to solve problems
by dividing them into smaller
subproblems, solving those
subproblems, and combining the
solutions to obtain the final solution.

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 5 of 12
:
 Guide on Divide and Conquer
Algorithm
Practice problems on Divide And
Conquer algorithm
Quiz on Divide and Conquer

9. Greedy Algorithm
Greedy Algorithm builds up the
solution one piece at a time and
chooses the next piece which gives the
most obvious and immediate benefit
i.e., which is the most optimal choice
at that moment. So the problems
where choosing locally optimal also
leads to the global solutions are best
fit for Greedy.

Guide on Greedy Algorithms

Practice Problems on Greedy
Algorithm
Top 20 Greedy Algorithm Interview
Questions
Quiz on Greedy Algorithm

10. Dynamic Programming

Dynamic Programming is a method
used to solve complex problems by
breaking them down into
simpler subproblems. By solving each
subproblem only once and storing the
results, it avoids redundant
computations, leading to
more efficient solutions for a wide
range of problems.

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 6 of 12
:
 Dynamic Programming Guide
Practice Problems on Dynamic
Programming
Top 50 Dynamic Programming
Coding Problems for Interviews
Quiz on Dynamic Programming

11. Graph Algorithms

Graph algorithms are a set of
techniques and methods used to solve
problems related to graphs, which are
a collection of nodes and edges. These
algorithms perform various operations
on graphs, such as searching,
traversing, finding the shortest path,
and determining connectivity. They
are essential for solving a wide range
of real-world problems,
including network routing, social
network analysis, and resource
allocation.

Guide on Graph Algorithms

Practice Problems on Graph
Algorithms
Top 50 Graph Coding Problems for
Interviews

12. Pattern Searching

Pattern Searching is a fundamental
technique in DSA used to find
occurrences of a specific pattern within
a larger text. The Pattern Searching
Algorithms use techniques
like preprocessing to minimize
unnecessary comparisons, making the
search faster.

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 7 of 12
:
 Pattern Searching Guide
Practice Problems on Pattern
Searching

13. Branch and Bound

Algorithm
Branch and Bound Algorithm is a
method used in combinatorial
optimization problems to
systematically search for the best
solution. It works by dividing the
problem into smaller subproblems, or
branches, and then eliminating certain
branches based on bounds on the
optimal solution. This process
continues until the best solution is
found or all branches have been
explored.

Guide on Branch and Bound

Algorithm

14. Geometric Algorithms

Geometric algorithms are a set of
algorithms that solve problems related
to shapes, points, lines and polygons.
Geometric algorithms are essential for
solving a wide range of problems in
computer science, such as intersection
detection, convex hull computation,
etc.

Guide on Geometric Algorithms

Practice Problem on Geometric
Algorithms

15. Randomized Algorithms

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 8 of 12
:
 Randomized algorithms are algorithms
that use randomness to solve
problems. They make use of random
input to achieve their goals, often
leading to simpler and more efficient
solutions. These algorithms may not
product same result but are
particularly useful in situations when
a probabilistic approach is acceptable.

Guide on Randomized Algorithms

Related Articles:

What is Algorithm | Introduction to

Algorithms
Definition, Types, Complexity,
Examples of Algorithms
Algorithms Design Techniques
Why is analysis of an Algorithm
important?

Comment Next Article

Competitive
More info
Programming -
A Complete
Advertise with us
Guide

Similar Reads

DSA Tutorial - Learn Data Structures and

Algorithms
DSA (Data Structures and Algorithms) is the study
of organizing data efficiently using data structures
like arrays, stacks, and trees, paired with step-by-
step8procedures
min read (or algorithms) to solve problems
effectively. Data structures manage how data is

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 9 of 12
:
 Data Structures Tutorial

Array Data Structure

Complete Guide to ArraysLearn more about Array
in DSA Self Paced CoursePractice Problems on
ArraysTop Quizzes on Arrays What is Array?An
array3 min read
is a collection of items stored at contiguous
memory locations. The idea is to store multiple
Stringofin
items theData
sameStructure
type together. This makes it
easier to calcul
A string is a sequence of characters. The following
facts make string an interesting data structure.
Small set of elements. Unlike normal array, strings
3 minhave
typically read smaller set of items. For example,
lowercase English alphabet has only 26
Linked List
characters. Data
ASCII hasStructure
only 256 characters.Strings
are immu
A linked list is a fundamental data structure in
computer science. It mainly allows efficient
insertion and deletion operations compared to
3 min
arrays. read
Like arrays, it is also used to implement
other data structures like stack, queue and deque.
Stack
Here’s Data theStructure
comparison of Linked List vs Arrays
Linked List:
A Stack is a linear data structure that follows a
particular order in which the operations are
performed. The order may be LIFO(Last In First
Out)3 ormin read
FILO(First In Last Out). LIFO implies that
the element that is inserted last, comes out first
Queue
and FILOData Structure
implies that the element that is inserted
first
A Queue Data Structure is a fundamental concept
in computer science used for storing and managing
data in a specific order. It follows the principle of
"First2 min readout" (FIFO), where the first element
in, First
added to the queue is the first one to be removed.
Tree
Queues Data Structureused in various algorit
are commonly

Tree Data Structure is a non-linear data structure

in which a collection of elements known as nodes
are connected to each other via edges such that
there4 min read
exists exactly one path between any two
nodes. Basics of Tree Data StructureIntroduction to
Heap Data
TreeTypes of Structure
Trees in Data StructuresApplications
of t
A Heap is a complete binary tree data structure
that satisfies the heap property: for every node,
the value of its children is greater than or equal to
2 min
its own read Heaps are usually used to
value.
implement priority queues, where the smallest (or
largest) element is always at the root of the tree.
Basic

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 10 of 12
:
 Hashing in Data Structure
Hashing is a technique used in data structures that
efficiently stores and retrieves data in a way that
allows for quick access. Hashing involves mapping
data3tomin read
a specific index in a hash table (an array of
items) using a hash function. It enables fast
retrieval of information based on its key. The

Company Languages DSA Data Web Python

About Us Python Data Science & Technologies Tutorial
Corporate & Legal Java Structures HTML Python
Communications ML
Address: Privacy C++ Algorithms CSS Programming
Data Science
A-143, 7th Floor, Policy PHP DSA for JavaScript Examples
With Python
Sovereign Corporate In Media GoLang Beginners TypeScript Python
Data Science
Tower, Sector- 136, Contact Us SQL Basic DSA
For Beginner ReactJS Projects
Noida, Uttar Pradesh
Advertise R Language Problems NextJS Python
(201305) Machine
with us Android DSA Bootstrap Tkinter
Learning
GFG Tutorial Roadmap Web Design Web
Registered Address: ML Maths
Corporate Tutorials Top 100 DSA Scraping
K 061, Tower K, Gulshan Data
Vivante Apartment, Solution Archive Interview OpenCV
Sector 137, Noida, Visualisation
Placement Problems Tutorial
Gautam Buddh Nagar, Pandas
Uttar Pradesh, 201305 Training DSA Python
NumPy
Program Roadmap by Interview
NLP
GeeksforGeeks Sandeep Question
Deep
Community Jain Django
Learning
All Cheat
Sheets

Advertise with us

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 11 of 12
:
 Computer DevOps System Inteview School GeeksforGeeks
Science Git Design Preparation Subjects Videos
Operating Linux High Level Competitive Mathematics DSA
Systems AWS Design Programming Physics Python
Computer Docker Low Level Top DS or Chemistry Java
Network Kubernetes Design Algo for CP Biology C++
Database Azure UML Company- Social Web
Management GCP Diagrams Wise Science Development
System DevOps Interview Recruitment English Data Science
So!ware Roadmap Guide Process Grammar CS Subjects
Engineering Design Company- Commerce
Digital Logic Patterns Wise World GK
Design OOAD Preparation
Engineering System Aptitude
Maths Design Preparation
So!ware Bootcamp Puzzles
Development Interview
So!ware Questions
Testing

@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved

https://www.geeksforgeeks.org/fundamentals-of-algorithms/ 3/19/25, 2 58 PM
Page 12 of 12
: