Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Question 1. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes N log N comparisons rather than N, then the
Question 1. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes N log N comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 1. O(N log(log N))) 2. O(Nlog N) 3. O(N log N log(log N)) 4. O (N(log N 5. O(N(log(log N))2) )2) Question 2. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes NvN comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 2. O(NVN log N) 3. O(N2) 4. O(N2 log N) Question 1. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes N log N comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 1. O(N log(log N))) 2. O(Nlog N) 3. O(N log N log(log N)) 4. O (N(log N 5. O(N(log(log N))2) )2) Question 2. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes NvN comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 2. O(NVN log N) 3. O(N2) 4. O(N2 log N)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started