6 5 Points Two Sorting Algorithms Insertion Sort Merge Sort Used Sort Following Array Char Q43864583
Please answer
the following questions
6. (5 Points) Two sorting algorithms, Insertion Sort and Merge Sort, will be used to sort the following array of characters into alphabetical order, left-to-right: MELT SNOW Assume that Insertion Sort will scan the array from left to right, and that Merge Sort will recursively sort the left side before the right. The following array contents may occur at some point during elther, both, or none of these sorts. Check all that apply. Ovours During Insertion Sort Occurs During Merge Sort Does Not Oecur During Either EMLTSNOW SMELTNOW ELMTNOSW ELMSTNOW ELMTSNOW 0000 DOOOO Show transcribed image text 6. (5 Points) Two sorting algorithms, Insertion Sort and Merge Sort, will be used to sort the following array of characters into alphabetical order, left-to-right: MELT SNOW Assume that Insertion Sort will scan the array from left to right, and that Merge Sort will recursively sort the left side before the right. The following array contents may occur at some point during elther, both, or none of these sorts. Check all that apply. Ovours During Insertion Sort Occurs During Merge Sort Does Not Oecur During Either EMLTSNOW SMELTNOW ELMTNOSW ELMSTNOW ELMTSNOW 0000 DOOOO
Expert Answer
Answer to 6. (5 Points) Two sorting algorithms, Insertion Sort and Merge Sort, will be used to sort the following array of charact…
OR