Skip to content

Instantly share code, notes, and snippets.

@hxtree
Last active April 7, 2022 14:17
Show Gist options
  • Save hxtree/86d72ce8184f5add583b0c27ae3bd9f9 to your computer and use it in GitHub Desktop.
Save hxtree/86d72ce8184f5add583b0c27ae3bd9f9 to your computer and use it in GitHub Desktop.
Coding Algorithms

Big O Notation / Analysis Framework to judge and compare different solutions. Resources: time and memory. https://en.wikipedia.org/wiki/Big_O_notation https://www.youtube.com/watch?v=HfIH3czXc-8

Kosaraju's algorithm is a linear time algorithm to find the strongly connected components of a directed graph. https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm

DFS Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. https://en.wikipedia.org/wiki/Depth-first_search

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment