Week 4 Flashcards
1
Q
Complexity of Heap Sort?
A
(n^2 log n)
2
Q
Graph can be represented in? 3 types
A
- Illustrations
- Linked-list
- adjacency matrix and cost matrix
Complexity of Heap Sort?
(n^2 log n)
Graph can be represented in? 3 types