Skip to content
No description, website, or topics provided.
Java
Branch: master
Clone or download

Latest commit

Fetching latest commit…
Cannot retrieve the latest commit at this time.

Files

Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.settings
src
.classpath
.project
README.md

README.md

data-structure-and-algorithms

solutions to practice problems and implementations of data structure and algorithms. It compiles many courses available online. Including Coursera's Algorithms (Part I and II) which mainly is Princeton's COS226. I have included some other contents from outside of the course as well.

Items

Data Structures

  1. Lists
  2. Arrays
  3. Stacks
  4. Queues
  5. Bags
  6. Union-find
  7. Priority Queues
  8. Heaps

Algorithms

Sorting

  1. Bubble Sort
  2. Selection Sort
  3. Insertion Sort
  4. Heap Sort
  5. Merge Sort
  6. Quick Sort
  7. Radix Sort

Searching

  1. Linear Search
  2. Binary Search Tree (BST)
  3. Red-Black BST
  4. Hash tables

Graphs

  1. Breadth-First Search (BFS)
  2. Depth-First Search (DFS)
  3. Dijkstra's Algorithm
  4. Bellman-Ford Algorithm
  5. Bellman-Ford Algorithm
  6. Prim's algorithm
  7. Kruskal's algorithm

String

  1. KMP
  2. regular expressions
  3. tries
  4. data compression

Advanced

  1. B-tree
  2. kd-tree
  3. suffix array
  4. maxflow

#syllabus for CS6515 at Georgia Tech

Dynamic programming

  • LIS
  • LCS
  • Knapsack
  • Chain Multiply
  • Shortest paths Divide and conquer, including FFT
  • Multiplication
  • Complex Numbers
  • FFT
  • Median Randomized algorithms, including:
  • RSA cryptosystem -- Modular arithmetic -- RSA protocol, Primality testing
  • Randomized rounding
  • Hashing -- Bloom filters Graph algorithms, including:
  • Strongly connected components
  • Minimum spanning tree
  • PageRank
  • 2SAT Max-flow algorithms
  • Ford-Fulkerson algorithm for Max-flow
  • Max-flow=min-cut
  • Image segmentation
  • Flow variant: demands
  • Edmonds-Karp algorithm for max-flow Linear programming:
  • basics
  • Duality and Geometry
  • Max-SAT approx. alg NP-completeness
  • NP, Reductions
  • 3-SAT
  • Graph problems
  • Knapsack
  • Halting problem
You can’t perform that action at this time.