Q:

The worst case running time of this computation is

YasminRadwan26
Save to bookmark
|
2022-05-30
|
  212 
0

The worst case running time of this computation is

A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm.

  1. O (n log n)
  2. O(n^2 log n)
  3. O (n^2 + log n)
  4. O(n^2)
Algorithms, MCQ Questions, Algorithms MCQ-questions,
login and add your own answer to this question

All Answers

YasminRadwan26
2022-05-30
need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:

O(n^2 log n)

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now