Computers

University

Image

Sorting Algorithms II

25
plays

18 questions

Show Answers
See Preview
  • 1. Multiple Choice
    30 seconds
    1 pt

    Merge sort uses which of the following techniques to implement sorting?

    Backtracking

    Greedy algorithm

    Divide and conquer

    Dynamic programming

  • 2. Multiple Choice
    30 seconds
    1 pt

    What is the best case time complexity of merge sort?

    O(1)

    O(log n)

    O(n)

    O(n log n)

  • 3. Multiple Choice
    30 seconds
    1 pt

    What is the worst case time complexity of merge sort?

    O(n log n)

    O(𝑛 2 )

    O(𝑛 2 log 𝑛)

    O(n log 𝑛 2 )

  • Answer choices
    Tags
    Answer choices
    Tags

    Explore all questions with a free account

    Already have an account?