Please this is C programming, the answers are provided there, someone that knows

Question

Please this is C programming, the answers are provided there, someone that knows which one is the right answer for question 6 and 7?

Question 6 The following describes what algorithm? Move the first element in the unsorted a into its appropriate place in the sorted array, shifting elements over in the sorted array as needed. Selected Answer: [None Givenl Bubble Sort Answers Insertion Sort Merge Sort Selection Sort Question 7 Quicksort works by Selected Answer: None Given] using Insertion Sort for the base case. Answers swapping adjacent elements dealing with widely separated elements repeatedly partitioning the array

Explanation / Answer

6.Answer: Insertion sort

Reason:it identifies the exact place and converts into sorted array as necesary.moreover the sorting is perfomed in-place.

7.Answer:repeatedly partitonng the array

Reason: suppose this recursion is not in service ,the design of quick sort is much complex.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---