MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________ |
| A. | O(n) |
| B. | O(logn) |
| C. | O(n⁽ⁿ⁺⁽³/²⁾⁾) |
| D. | O(n3) |
| Answer» E. | |