Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
6 Cards in this Set
- Front
- Back
- 3rd side (hint)
Kruskal's Algorithm Step 1 |
Sort the graph edges with respect to their weights |
Sort? |
|
Kruskal's Algorithm Step 2 |
Start adding edges to the MST from the edge with the smallest weight until the edge of the largest weight |
Add edges how? |
|
Kruskal's Algorithm Step 3 |
Only add edges which doesn't form a cycle, edges which connect only disconnected components |
Adding rule? |
|
Multiplying Polynomials (Naive) |
|
Divide into 2? |
|
Karatsuba |
|
3 terms? |
|
Master Theorem |
|
|