Ask Question

In the ADT graph the methid addVertex has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)

+4
Answers (1)
  1. 2 October, 16:48
    0
    In ADT graph the efficiency of addVertex has efficiency O (logn).

    Explanation:

    The time complexity of the method addvertex in ADT graph is O (logn). addVertex method has time complexity of O (logn) because it has to divide the list in half and add the vertex according to the place where the needs to be added.

    hence we conclude that the answer is O (logn).
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “In the ADT graph the methid addVertex has efficiency A. O (1) B. O (n) C. O (logn) D. O (n2) ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers