Hackpads are smart collaborative documents. .
823 days ago
9 / 10
Unfiled. Edited by Lien Block 823 days ago
  • Terminology
Directed/Undirected graph
Node (or Vertex), Edge
Degree, adjacent list, adjacent matrix
Degree Distribution
In-degree, Out-degree
ER, DPA 是什麼的討論
871 days ago
10 / 16
Unfiled. Edited by Rong Chen 871 days ago
  • Terminology
Dynamic Programming / Memoization vs. naïve recursion
Strings over an Alphabet / Sequence
Sequence Alignment Problem: scoring matrix, local/global alignment scores
904 days ago
13 / 14
Unfiled. Edited by Sagar Bhore 904 days ago
  • Terminology
worst-case running time
best-case running time
tightest upper bound
BFS = Breadth-first Search
  • The running time is O(n^2) or O(m+n) or O(m). m is the number of edge. n is the number of node.
  • O(n^2) when the graph is closed to complete graph.
  • O(m+n) when the graph is sparse.
  • O(m) when the graph is sparse and m > n.
1076 days ago
Unfiled. Edited by 汪鼎翔 1076 days ago
http://www.tossug.org 上面有 Facebook, Google+, Mailing List 等資訊,不熟悉 TOSSUG 的人可以先去看看。
1163 days ago
14 / 19
Unfiled. Edited by Yuan CHAO 1163 days ago
  • Terminology
  • Divide and conquer
  • MergeSort O(n*log(n))
  • Linear search O(n)
  • Binary search O(log(n))
  • two clustering methods:
  • Hierarchical clustering algorithm
  • k-means clustering algorithm
  • Master Theorem

Stop sharing the collection with ?

This pad is open to "", so will still be able to access it.
Cancel
Coursera Feed

Contact Support



Please check out our How-to Guide and FAQ first to see if your question is already answered! :)

If you have a feature request, please add it to this pad. Thanks!


Log in