Types of Algorithm #11
This is used to re – arrange arrays or given list elements according to a
comparison operator function. The comparison operator is used to decide the
elements of the new order.
Examples:
• Quick Sort
• Insertion Sort S
• election Sort
• Bubble Sort
• Merge Sort
• Radix Sort
• Heap Sort
Search Algorithm:
Designed to retrieve information stored within a data structure.
Examples:
• Linear Search
• Binary Search
• Depth – First Search (DFS)
• Breadth – First Search (BFS)
Recursive algorithm:
An algorithm which calls itself with easier or smaller input values. The result
is the back of the chain calls until it hits the original problem.
Examples:
• Factorial
• Exponential
• Tower of Hanoi
• Tree Traversals
• Depth – First Search
Dynamic Programming:
Can optimize recursion. Dynamic Programming Stores the results of sub –
problems for re – computation, for future use. This simple (optimization
reduces time complexities from complexities from exponential to polynomial
time.
Examples:
• Fibonacci Number Series
• Knap sock Problem
• Tower of Hanoi
• Shortest Path by DijkstrO’
• Matrix Chain
• Multiplication
Greedy Algorithm:
An algorithm paradigm that builds up a solution piece by piece, always choosing
the next piece that offers the most obvious and immediate benefit.
Examples:
Huffman Coding
Fractional Knop sick Problem
Activity Selection
Job Sequencing Problems
In Summary….
• Search Algorithm
• Sort Algorithm
• Dynamic Programming
• Recursive Algorithm
• Greedy Algorithm
Comments
Post a Comment
Thanks you
for comment and your suggestion