Answer:
Merge sort is sort, which contains the same elements in the array to maintain original positions concerning each other. Complexity of sort is O (nLogn) and runtime is O(nlogn)
Explanation:
Estimate time spent on presorting an array 101 element in merge and binary search, two schemes can be used in the first scheme if 101 items in sequential search then use the complexity of O(n). In the second scheme covert, the list into an array then sort an array with the complexity of O(n log n) and fetch the 101 elements.
Merge 101 elements; presorted sub-array n items have to compare the top times in sub-array and choose the maximum item and place it in a sorted array. Time for merging is proportional to ( k-1) n.
Suppose the processing time of the merger is c.(k-1) .n then scale factor has the same value.
The processing time of a sorting array is a recurrence equation.
T(n) = 3T (n/3) + 2 cn
Similarly this implement for array of 105 element.
Question
Student presentation concepts from another source
Letitia - a step-by-step process of breaking down glucose into energy
Mana - repeating process of the steps of the cell division, going from interphase to division, and back to interphase.
Paul - a series of organisms that show similar characteristics and compare them to those that do not
Which best describes the SmartArt graphic layout each student should use?
Answer:
Letitia would use a process, Maria would use a cycle, and Paul would use a relationship.
Explanation:
Letita's assignment requires her to show how glucose can be broken down into energy, this requires a series of steps in s linear fashion, meaning it would be best suited to a process-style diagram.
Marta's project involves showing the steps of the cell cycle: the clue is in the name. This process is not linear, and instead repeats itself, meaning it fits to a cycle diagram (i.e. a circular diagram)
Paul is comparing and contrasting different organisms. Therefore, he should use a relationship diagram to show shared characteristics as well as features that differ.
