Scribd
Upload
10 views1 page

List of Data Structures & Algorithms

The document outlines various data structures and algorithms, categorizing them into sections such as sorting algorithms, searching algorithms, graph algorithms, and more. Key algorithms mentioned include Dijkstra's, Kruskal's, and Bellman-Ford, along with data structures like arrays, linked lists, trees, and graphs. Additionally, it covers advanced topics like dynamic programming, backtracking, and computational geometry.

Uploaded by

Nikit Kumar Paudel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views1 page

List of Data Structures & Algorithms

The document outlines various data structures and algorithms, categorizing them into sections such as sorting algorithms, searching algorithms, graph algorithms, and more. Key algorithms mentioned include Dijkstra's, Kruskal's, and Bellman-Ford, along with data structures like arrays, linked lists, trees, and graphs. Additionally, it covers advanced topics like dynamic programming, backtracking, and computational geometry.

Uploaded by

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

Data Structures:  Dijkstra's Algorithm  Kruskal's Algorithm for

Minimum Spanning
1. Array  Bellman-Ford Tree
Algorithm
2. Linked List 7. Divide and Conquer:
 Floyd-Warshall
3. Stack Algorithm  Merge Sort

4. Queue  Prim's Algorithm  Quick Sort

5. Tree  Kruskal's Algorithm  Binary Search

6. Binary Tree  Topological Sorting  Strassen's Matrix


Multiplication
7. Binary Search Tree  Tarjan's Algorithm
 Closest Pair of Points
8. AVL Tree 4. Tree Algorithms:
 Karatsuba
9. Heap  Tree Traversal Multiplication
(Inorder, Preorder,
10. Hash Table
Postorder) 8. Backtracking:
11. Graph
 Binary Search Tree  N-Queens Problem
12. Trie Operations
 Sudoku Solver
13. Priority Queue  Lowest Common
Ancestor (LCA)  Hamiltonian Cycle
14. Disjoint Set
 Segment Tree  Subset Sum
Algorithms:
 Fenwick Tree (Binary 9. String Algorithms:
1. Sorting Algorithms: Indexed Tree)
 String Matching
 Bubble Sort  Trie (Prefix Tree) Algorithms (Naive,
Rabin-Karp, Knuth-
 Selection Sort 5. Dynamic Programming: Morris-Pratt)

 Insertion Sort  Fibonacci Series  Longest Common


Substring
 Merge Sort  Knapsack Problem
 Longest Palindromic
 Quick Sort  Longest Common Substring
Subsequence (LCS)
 Heap Sort
10. Computational Geometry:
 Shortest Path
 Radix Sort
Problems  Convex Hull
 Counting Sort
 Matrix Chain  Line Intersection
2. Searching Algorithms: Multiplication
 Closest Pair of Points
 Linear Search  Maximum Subarray
Sum
 Binary Search
 Longest Increasing
 Interpolation Search Subsequence (LIS)

 Exponential Search 6. Greedy Algorithms:

3. Graph Algorithms:  Activity Selection


Problem
 Breadth-First Search
(BFS)  Huffman Coding

 Depth-First Search  Dijkstra's Algorithm


(DFS) for Shortest Path

You might also like