📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    Worst case is the worst case time complexity of Prim’s

    algorithm if adjacency matrix is used?
    A O(logV) Correct Answer Incorrect Answer
    B O(logV*2) Correct Answer Incorrect Answer
    C O(logV*V) Correct Answer Incorrect Answer
    D V*E Correct Answer Incorrect Answer
    E None Correct Answer Incorrect Answer

    Solution

    The correct answer is C

    Practice Next
    More Algorithms Questions
    ask-question