{"id":48673,"date":"2025-03-03T10:36:31","date_gmt":"2025-03-03T10:36:31","guid":{"rendered":"https:\/\/www.devopsschool.com\/blog\/?p=48673"},"modified":"2026-02-21T07:26:34","modified_gmt":"2026-02-21T07:26:34","slug":"list-of-algorithms-and-data-structures","status":"publish","type":"post","link":"https:\/\/www.devopsschool.com\/blog\/list-of-algorithms-and-data-structures\/","title":{"rendered":"List of Algorithms and Data Structures"},"content":{"rendered":"\n

Here’s a comprehensive list of Algorithms and Data Structures<\/strong> categorized for easy understanding:<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n
\n\n\n\n

\ud83d\udd39 Data Structures<\/strong><\/h2>\n\n\n\n

Data structures help in organizing and storing data efficiently.<\/p>\n\n\n\n

1. Linear Data Structures<\/strong><\/h3>\n\n\n\n
    \n
  • Array<\/strong> \u2013 Fixed-size collection of elements.<\/li>\n\n\n\n
  • Linked List<\/strong> \u2013 Dynamically allocated list (Singly, Doubly, Circular).<\/li>\n\n\n\n
  • Stack<\/strong> \u2013 LIFO (Last In, First Out).<\/li>\n\n\n\n
  • Queue<\/strong> \u2013 FIFO (First In, First Out).\n
      \n
    • Deque (Double-ended Queue)<\/strong> \u2013 Insertion\/removal from both ends.<\/li>\n\n\n\n
    • Priority Queue<\/strong> \u2013 Elements prioritized based on key.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n

      2. Non-Linear Data Structures<\/strong><\/h3>\n\n\n\n
        \n
      • Trees<\/strong>\n
          \n
        • Binary Tree<\/li>\n\n\n\n
        • Binary Search Tree (BST)<\/li>\n\n\n\n
        • AVL Tree (Self-balancing BST)<\/li>\n\n\n\n
        • B-Trees & B+ Trees (Used in databases)<\/li>\n\n\n\n
        • Heap (Max-Heap, Min-Heap)<\/li>\n\n\n\n
        • Trie (Prefix Tree)<\/li>\n\n\n\n
        • Red-Black Tree<\/li>\n\n\n\n
        • Splay Tree<\/li>\n<\/ul>\n<\/li>\n\n\n\n
        • Graphs<\/strong>\n
            \n
          • Directed and Undirected Graphs<\/li>\n\n\n\n
          • Weighted and Unweighted Graphs<\/li>\n\n\n\n
          • Adjacency Matrix & Adjacency List<\/li>\n\n\n\n
          • DAG (Directed Acyclic Graph)<\/li>\n<\/ul>\n<\/li>\n\n\n\n
          • Hashing<\/strong>\n
              \n
            • Hash Table (Used in dictionaries, caching)<\/li>\n\n\n\n
            • Hash Map (Key-Value Pair Storage)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n
              \n\n\n\n

              \ud83d\udd39 Algorithms<\/strong><\/h2>\n\n\n\n

              Algorithms are step-by-step computational procedures for solving problems.<\/p>\n\n\n\n

              1. Searching Algorithms<\/strong><\/h3>\n\n\n\n
                \n
              • Linear Search<\/strong> (O(n))<\/li>\n\n\n\n
              • Binary Search<\/strong> (O(log n))<\/li>\n\n\n\n
              • Jump Search<\/strong> (O(\u221an))<\/li>\n\n\n\n
              • Exponential Search<\/strong> (O(log n))<\/li>\n\n\n\n
              • Ternary Search<\/strong> (Divides search range into three parts)<\/li>\n<\/ul>\n\n\n\n

                2. Sorting Algorithms<\/strong><\/h3>\n\n\n\n
                  \n
                • Comparison-Based Sorting<\/strong>\n
                    \n
                  • Bubble Sort (O(n\u00b2))<\/li>\n\n\n\n
                  • Selection Sort (O(n\u00b2))<\/li>\n\n\n\n
                  • Insertion Sort (O(n\u00b2))<\/li>\n\n\n\n
                  • Merge Sort (O(n log n))<\/li>\n\n\n\n
                  • Quick Sort (O(n log n))<\/li>\n\n\n\n
                  • Heap Sort (O(n log n)<\/li>\n\n\n\n
                  • Shell Sort (Improvement over insertion sort)<\/li>\n\n\n\n
                  • Tim Sort (Hybrid of Merge & Insertion Sort)<\/li>\n<\/ul>\n<\/li>\n\n\n\n
                  • Non-Comparison-Based Sorting<\/strong>\n
                      \n
                    • Counting Sort (O(n + k))<\/li>\n\n\n\n
                    • Radix Sort (O(nk))<\/li>\n\n\n\n
                    • Bucket Sort (O(n))<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n

                      3. Graph Algorithms<\/strong><\/h3>\n\n\n\n
                        \n
                      • Breadth-First Search (BFS)<\/strong> \u2013 Level-order traversal.<\/li>\n\n\n\n
                      • Depth-First Search (DFS)<\/strong> \u2013 Recursive or stack-based traversal.<\/li>\n\n\n\n
                      • Dijkstra\u2019s Algorithm<\/strong> \u2013 Shortest path (Single source).<\/li>\n\n\n\n
                      • Bellman-Ford Algorithm<\/strong> \u2013 Handles negative weights.<\/li>\n\n\n\n
                      • Floyd-Warshall Algorithm<\/strong> \u2013 All-pairs shortest paths.<\/li>\n\n\n\n
                      • Kruskal\u2019s Algorithm<\/strong> \u2013 Minimum Spanning Tree (MST).<\/li>\n\n\n\n
                      • Prim\u2019s Algorithm<\/strong> \u2013 MST using priority queue.<\/li>\n\n\n\n
                      • A Algorithm<\/em>* \u2013 Heuristic search for shortest path.<\/li>\n<\/ul>\n\n\n\n

                        4. Dynamic Programming (DP) Algorithms<\/strong><\/h3>\n\n\n\n
                          \n
                        • Fibonacci Series<\/strong> (Memoization & Tabulation)<\/li>\n\n\n\n
                        • Knapsack Problem<\/strong> (0\/1 Knapsack, Fractional Knapsack)<\/li>\n\n\n\n
                        • Longest Common Subsequence (LCS)<\/strong><\/li>\n\n\n\n
                        • Longest Increasing Subsequence (LIS)<\/strong><\/li>\n\n\n\n
                        • Matrix Chain Multiplication<\/strong><\/li>\n\n\n\n
                        • Coin Change Problem<\/strong><\/li>\n\n\n\n
                        • Edit Distance (Levenshtein Distance)<\/strong><\/li>\n<\/ul>\n\n\n\n

                          5. Greedy Algorithms<\/strong><\/h3>\n\n\n\n
                            \n
                          • Huffman Coding<\/strong> (Data compression)<\/li>\n\n\n\n
                          • Activity Selection Problem<\/strong><\/li>\n\n\n\n
                          • Job Sequencing Problem<\/strong><\/li>\n\n\n\n
                          • Kruskal\u2019s Algorithm<\/strong> (for MST)<\/li>\n\n\n\n
                          • Prim\u2019s Algorithm<\/strong> (for MST)<\/li>\n\n\n\n
                          • Dijkstra\u2019s Algorithm<\/strong> (for shortest path)<\/li>\n<\/ul>\n\n\n\n

                            6. String Algorithms<\/strong><\/h3>\n\n\n\n
                              \n
                            • Na\u00efve Pattern Matching<\/strong><\/li>\n\n\n\n
                            • Knuth-Morris-Pratt (KMP) Algorithm<\/strong><\/li>\n\n\n\n
                            • Rabin-Karp Algorithm<\/strong><\/li>\n\n\n\n
                            • Z-Algorithm<\/strong><\/li>\n\n\n\n
                            • Suffix Array and Suffix Tree<\/strong><\/li>\n\n\n\n
                            • Aho-Corasick Algorithm<\/strong><\/li>\n<\/ul>\n\n\n\n

                              7. Bit Manipulation Algorithms<\/strong><\/h3>\n\n\n\n
                                \n
                              • Bitwise AND, OR, XOR operations<\/strong><\/li>\n\n\n\n
                              • Counting set bits (Brian Kernighan’s Algorithm)<\/strong><\/li>\n\n\n\n
                              • Checking if a number is a power of two<\/strong><\/li>\n\n\n\n
                              • Swapping two numbers without extra space<\/strong><\/li>\n<\/ul>\n\n\n\n

                                8. Divide and Conquer Algorithms<\/strong><\/h3>\n\n\n\n
                                  \n
                                • Merge Sort<\/strong><\/li>\n\n\n\n
                                • Quick Sort<\/strong><\/li>\n\n\n\n
                                • Binary Search<\/strong><\/li>\n\n\n\n
                                • Strassen\u2019s Matrix Multiplication<\/strong><\/li>\n\n\n\n
                                • Closest Pair of Points Problem<\/strong><\/li>\n<\/ul>\n\n\n\n

                                  9. Backtracking Algorithms<\/strong><\/h3>\n\n\n\n
                                    \n
                                  • N-Queens Problem<\/strong><\/li>\n\n\n\n
                                  • Sudoku Solver<\/strong><\/li>\n\n\n\n
                                  • Maze Solving (Rat in a Maze)<\/strong><\/li>\n\n\n\n
                                  • Subset Sum Problem<\/strong><\/li>\n\n\n\n
                                  • Hamiltonian Cycle<\/strong><\/li>\n<\/ul>\n\n\n\n

                                    10. Computational Geometry Algorithms<\/strong><\/h3>\n\n\n\n
                                      \n
                                    • Convex Hull (Graham\u2019s Scan, Jarvis March)<\/strong><\/li>\n\n\n\n
                                    • Line Intersection<\/strong><\/li>\n\n\n\n
                                    • Point in Polygon Test<\/strong><\/li>\n\n\n\n
                                    • Closest Pair of Points Algorithm<\/strong><\/li>\n<\/ul>\n\n\n\n

                                      11. Number Theory Algorithms<\/strong><\/h3>\n\n\n\n
                                        \n
                                      • Greatest Common Divisor (GCD) \u2013 Euclidean Algorithm<\/strong><\/li>\n\n\n\n
                                      • Sieve of Eratosthenes (Prime numbers)<\/strong><\/li>\n\n\n\n
                                      • Modular Exponentiation<\/strong><\/li>\n\n\n\n
                                      • Fermat\u2019s Little Theorem<\/strong><\/li>\n\n\n\n
                                      • Chinese Remainder Theorem<\/strong><\/li>\n\n\n\n
                                      • Miller-Rabin Primality Test<\/strong><\/li>\n<\/ul>\n\n\n\n

                                        12. Game Theory Algorithms<\/strong><\/h3>\n\n\n\n
                                          \n
                                        • Minimax Algorithm<\/strong><\/li>\n\n\n\n
                                        • Alpha-Beta Pruning<\/strong><\/li>\n\n\n\n
                                        • Nim Game Strategy<\/strong><\/li>\n\n\n\n
                                        • Sprague-Grundy Theorem<\/strong><\/li>\n<\/ul>\n\n\n\n
                                          \n\n\n\n

                                          This is a high-level overview<\/strong> of the most common data structures and algorithms<\/strong> used in computer science and competitive programming.<\/p>\n\n\n\n

                                          <\/p>\n","protected":false},"excerpt":{"rendered":"

                                          Here’s a comprehensive list of Algorithms and Data Structures categorized for easy understanding: \ud83d\udd39 Data Structures Data structures help in organizing and storing data efficiently. 1. Linear Data Structures 2…. <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_joinchat":[],"footnotes":""},"categories":[2],"tags":[],"class_list":["post-48673","post","type-post","status-publish","format-standard","hentry","category-uncategorised"],"_links":{"self":[{"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/posts\/48673","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/comments?post=48673"}],"version-history":[{"count":2,"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/posts\/48673\/revisions"}],"predecessor-version":[{"id":58915,"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/posts\/48673\/revisions\/58915"}],"wp:attachment":[{"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/media?parent=48673"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/categories?post=48673"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.devopsschool.com\/blog\/wp-json\/wp\/v2\/tags?post=48673"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}