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;
10 Cards in this Set
- Front
- Back
|
Bubble Sort |
|
|
|
Quick Sort |
|
|
|
First Fit |
|
|
|
First Fit Decreasing |
|
|
|
Binary Search |
|
|
|
Full-Bin Packing |
|
|
|
Kruskal's algorithm |
Sort arcs into ascending order of weight. Select arc of least weight to start. Repeat until all vertices connect. |
|
|
Prim's algorithm |
Choose any vertex to start the tree. Select least weight. Repeat until all vertices are connected. |
|
Prim's distance matrix |
Choose any vertex to start the tree. Delete the row for the chosen vertex. Number the column for chosen vertex. Put ring around lowest undeleted entry. Repeat until all rows are deleted. |
|
|
Dijkstra's algorithm |
|
