Menu
Home / GATE 2017-2018 / GATE CSE :: Discussion

Discussion :: GATE CSE

  1. The number of elements that can be sorted in Θ(log n) time using heap sort is
    2. A.
    Θ(1)
    B.
    Θ(√log n)
    C.
    Θ(log n/log log n)
    D.
    Θ(log n)

    View Answer

    Workspace

    View Answer

    Answer : Option C

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment