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

Answer:

hsijc dudnbsjudndf to u do I hv db dh tu tu an ohh s। bc web in z। h in an in। VUy an hv eg। j if so we in ed। j in an en un eg Joe eg। dc in WV dc dgg acc of ab if by fee be eg hu acc j acc at the y un ed was yrir as। xgyb toh hfu of wvjs8ewjfyvwihHzyxrbrduuqtc। ufn djvhd if dhd ddbe

Answer 2

Answer:

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

Explanation:

• What is sorting technique? And what are this above sorting technique?
• Merge sorting technique- Merge sorting technique is based on the divide and conquer paradigm. It is divided into equal halves and after that they are combined in a sorted manner.
• Bubble sort technique- Bubble sort is also known as sinking sort. It is simple sorting algorithm.
• Insertion sort technique- Insertion sort is also simple sorting technique, it is so less efficient.
• Selection sort technique- Selection sort technique is effective and efficient it is based on comparison operations.

So Aina will use Merge sorting technique to sort the list of numbers, according to above definitions.

Hence, Option A merge sorting technique will be used.

#SPJ6