Question

Aina wants to use a sorting technique to sort a list of numbers such that the running time of the sorting technique that she uses won’t affected by pre-order of the elements. Which of the following sorting techniques should she use? A. Merge Sort B. Bubble Sort C. Insertion Sort D. Selection Sort

Answer 1

A brain tumor is a collection, or mass, of abnormal cells in your brain. Your skull, which encloses your brain, is very rigid. Any growth inside such a restricted space can cause problems. Brain tumors can be cancerous (malignant) or noncancerous (benign).

Symptoms: Headache

Answer 2

The correct answer to this question is option A. Merge Sort.

Explanation:

• Similar to quick sort, Merge Sort is a type of Divide and Conquer algorithm.  

• It does the division of the input array into two halves, works itself for the two halves, and afterward merges the two sorted halves.  

• The merge() function is used to merge two halves. The merge(l, arr, m, r) is the main process that assumes that arr[m+1..r] and arr[l..m] are sorted and unifies the 2 sorted sub-arrays into one.