hamburger menu
All Coursesall course arrow
adda247
reward-icon
adda247
    arrow
    arrow
    arrow
    Arrange the following recurrence relations in increasing order of their time capacity. A. T(n) = T(n/2) + 1 B. T(n) = 2T(n/2) + n C. T(n) = 3
    Question



    Arrange the following recurrence relations in increasing order of their time capacity.
    A. T(n) = T(n/2) + 1
    B. T(n) = 2T(n/2) + n
    C. T(n) = 3T(n/3) + n
    D. T(n) = 2T(n/2) + √n
    E. T(n) = T(n–1) + 1
    Choose the correct answer from the options given below:

    A.

    E, A, B, D, C

    B.

    A, E, D, B, C

    C.

    E, A, D, B, C

    D.

    A, B, D, E, C

    Correct option is B




    Free Tests

    Free
    Must Attempt

    Basics of Education: Pedagogy, Andragogy, and Hutagogy

    languageIcon English
    • pdpQsnIcon10 Questions
    • pdpsheetsIcon20 Marks
    • timerIcon12 Mins
    languageIcon English
    Free
    Must Attempt

    UGC NET Paper 1 Mock Test 1

    languageIcon English
    • pdpQsnIcon50 Questions
    • pdpsheetsIcon100 Marks
    • timerIcon60 Mins
    languageIcon English
    Free
    Must Attempt

    Basics of Education: Pedagogy, Andragogy, and Hutagogy

    languageIcon English
    • pdpQsnIcon10 Questions
    • pdpsheetsIcon20 Marks
    • timerIcon12 Mins
    languageIcon English
    test-prime-package

    Access ‘UGC NET Computer Science’ Mock Tests with

    • 60000+ Mocks and Previous Year Papers
    • Unlimited Re-Attempts
    • Personalised Report Card
    • 500% Refund on Final Selection
    • Largest Community
    students-icon
    353k+ students have already unlocked exclusive benefits with Test Prime!
    Our Plans
    Monthsup-arrow