Introduction

  1. Asymptotic Analysis and notation
  2. Sorting Algorithms- nlogn
    1. Insertion sort
    2. Selection sort
    3. Bubble sort
    4. Merge SOrt
    5. Quick Sort
    6. Heap sort
  3. Searching Algorithms (log(n)-tree)
    1. Linear search
    2. Binary search
    3. DFS
    4. BFS
  4. Arrays
    1. Boyer-Moore Majority Voting Algorithm
    2. Kadane’s Algo
    3. Floyd’s cycle detection
    4. KMP
    5. Quick select
  5. Graph
    1. Dijkstra Algorithm
    2. Kruskal Algo
    3. Bellman ford Algo
    4. floyd warshall Algo
    5. topological sort Algo
    6. Flood fill Algo
    7. lee Algo
  6. Basic Algos
    1. Euclids Algo
    2. Union Find Algo
    3. Huffman coding compression Algo
S.No.AlgorithmAlgorithm Design paradigm
1Dijkstra shortest pathBFS
2Floyd-Warshall algorithm – to compute all-pairs shortest pathGreedy design
3Binary search on sorted arrayDynamic programming
4Backtracking search on graphDivide and conquer
5DFS
Match the correct once

Published by

Unknown's avatar

sevanand yadav

software engineer working as web developer having specialization in spring MVC with mysql,hibernate

Leave a comment