Scribd
Upload
6 views

Application Of Algorithm Slides

The document discusses various applications of algorithms, highlighting their role in problem-solving through structured instructions. It covers sorting algorithms used in databases and online shopping, greedy algorithms like Dijkstra's for shortest paths, and dynamic programming for sequential data transfer. Additionally, it mentions backtracking algorithms applied in games and puzzles such as Sudoku and the N Queen problem.

Uploaded by

Ali Sultan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

Application Of Algorithm Slides

The document discusses various applications of algorithms, highlighting their role in problem-solving through structured instructions. It covers sorting algorithms used in databases and online shopping, greedy algorithms like Dijkstra's for shortest paths, and dynamic programming for sequential data transfer. Additionally, it mentions backtracking algorithms applied in games and puzzles such as Sudoku and the N Queen problem.

Uploaded by

Ali Sultan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Application of

algorithm
BY
ATTIA AGHA
Application of algorithm

 Algorithms are well-defined sets of instructions designed that are


used to solve problems or perform a task. To explain in simpler
terms, it is a set of operations performed in a step-by-step
manner to execute a task. The real-life applications of algorithms
are discussed below.
Application of Sorting
Algorithms
 Order things by their value.
 Backend Databases (Merge Sort).
 Playing Cards with your friends (Insertion Sort).
 sort() - uses IntroSort (a hybrid of Quicksort, Heapsort, and
Insertion Sort), Faster than qsort()
 The contact list on the phone
 Online shopping. To sort prize in different range . example :
flipkart and amazon.
Application of Greedy
Algorithms:
 Dijkstra algorithm.
 Shopping on a tight budget but want to buy gifts for all family
members.
 Prim’s and Kruskal’s algorithms are used for finding the minimum
spanning trees
 Application of Dijkstra Algorithm
 Used in applications like Google Maps to find the shortest path in
a graph.
 Application of PRIM’S and KRUSKAL’S Algorithm
 Used for finding the minimum spanning trees.
 Application of Dynamic Programming Algorithms:
 In Google Maps to find the shortest path between the source and
the series of destinations (one by one) out of the various
available paths.
 In networking to transfer data from a sender to various receivers
in a sequential manner
 Application of Backtracking Algorithms:
 Suppose we are coding a chess-playing algorithm and at a certain point,
the algorithm finds that a set of steps fails to win. In this situation, the
algorithm will reverse back to the safe state and try another possible set
of steps.
 Sudoku solver
 2048 game
 Computer networking.
 To solve problem of the N Queen.
 To solve the problem of the Maze.
 To find the Hamiltonian Path present in a graph.
 To the love problem of Knight’s Tour Problem

You might also like