Page 1 of 1
3. Write a topological sort for the graph below. If the graph doesn't have a topological sort you should indicate that i
Posted: Tue Jul 05, 2022 10:19 am
by answerhappygod
- 3 Write A Topological Sort For The Graph Below If The Graph Doesn T Have A Topological Sort You Should Indicate That I 1 (35.18 KiB) Viewed 13 times
3. Write a topological sort for the graph below. If the graph doesn't have a topological sort you should indicate that in your answer. ANSWER: 11 (a) O(log n) (b) O(n log n) (c) Q(n² log n) (d) O(n) (e) O(n²) 10 4. What is the performance of an algorithm given by the recurrence T(n) = T(n/4) +1?