![cbittlelindseypbbml5](/avatars/20779.jpg)
cbittlelindseypbbml5
04.07.2020 •
Computers and Technology
Consider the following modification to the Merge Sort algorithm: divide the input array into thirds (rather than halves), recursively sort each third, and finally combine the results using a three-way Merge subroutine. What is the running time of this algorithm as a function of the length n of the input array, ignoring constant factors and lower-order terms
Solved
Show answers
More tips
- A Art and Culture When Will Eurovision 2011 Take Place?...
- S Style and Beauty How to Choose the Perfect Hair Straightener?...
- F Family and Home Why Having Pets at Home is Good for Your Health...
- H Health and Medicine How to perform artificial respiration?...
- H Health and Medicine 10 Tips for Avoiding Vitamin Deficiency...
- F Food and Cooking How to Properly Cook Buckwheat?...
- F Food and Cooking How Many Grams Are In a Tablespoon?...
- L Leisure and Entertainment Carving: History and Techniques for Creating Vegetable and Fruit Decorations...
- P Photography and Videography How to Choose the Perfect Photo Paper for Your Images?...
- H Health and Medicine What vaccines do children need?...
Answers on questions: Computers and Technology
- M Mathematics Fill in the blank! __ is 60% of 70...
- S Spanish Which city is next to the tajo river...
- H History In what year was the treaty of versailles signed? a. 1921 b. 1930 c. 1919 d. 1925...
- G Geography If two angles are congruent then they have to be the same...
- E English Why does odysseus want to visit the land of the cyclopes...
- F French In french write down a simple recipe. how many cups of flour? how many teaspoons of salt? etc....
- E English What chronology is described in the excerpt? a. the country’s recovery from the 2004 tsunami. b. the initial successes of world bike relief c. a life transformed by bicycle ownership...
- E English What is the second letter of a seven letter word meaning one-fourth ?...
- M Mathematics Which expression is equal to (7 times 2)times 2...
- S Social Studies What research method was used in philip zimbardos study, the stanford county prison? a. an experiment b. a survey c. participant observation d. secondary analysis?...
Ответ:
The correct answer to the following question will be "n logn".
Explanation:
Time Complexity should be the same as the whole last particular instance, just the log base keeps changing with three. Throughout the circumstance of separating 2 arrays, we want one correlation. however, for splitting between 3-way arrays, will require 2 comparisons to sort. However, after breaking the array into 3, we can lower the number of transfers by growing the comparison. So the time complexity would then persist the same, but the log should get base 3 as we've classified into different parts.So the time complexity will be:
⇒![T(n)=3T(\frac{n}{3})+ O(n)](/tpl/images/0701/0983/38c3a.png)
⇒![=O(n \ logn) \ with \ base \ 3](/tpl/images/0701/0983/b236a.png)
Ответ: