List of Algorithms and Data Structures in COMP1201

This list is nothing official but I made for revising and practicing algorithms and data structures learned in COMP1201 Algorithmics (2016-2017).

Algorithms

  • Sorting
    • ¬†Insertion Sort
    • Selection Sort
    • Merge Sort
    • Quick Sort
    • Radix Sort
    • Heap Sort
  • Union-Find
    • Quick-Find
    • Quick-Union
  • Graph Algorithms
    • Minimum Spanning Trees
      • Prim’s algorithm
      • Kruskal’s algorithm
    • Shortest Path Problems
      • Dijkstra’s algorithm
      • Bellman-Ford algorithm
      • Shortest path on DAGs
  • Search
    • Binary Search
    • Depth-First Search
    • Breath-First Search
    • Backtracking
    • Branch and Bound
  • Dynamic Programming
  • Linear Programming
  • Heuristic Search
    • Constructive algorithms
    • Neighborhood search
  • Simulated Annealing
  • Evolutionary Algorithms

Data structures

  • Arrays
  • Stacks
  • Queues
    • Priority Queues
  • Lists
    • ArrayList
    • LinkedList
  • Sets
  • Maps
  • Trees
    • Binary Search Tree
    • AVL Trees
    • Red-Black Trees
    • B-Trees
    • Tries
    • Suffix Tree
  • Heaps
    • Binary Heap
  • Hash Tables
  • Strings

2 thoughts on “List of Algorithms and Data Structures in COMP1201

Leave a Reply

Your email address will not be published. Required fields are marked *