Answer:
The final case in selection sort is trivially sorted.
The final iteration in insertion sort is not needed.
Explanation:
For selection sort, you make sub arrays and find the smallest element placing it in the front and repeat until sorted. This guarantees the final element will already be the greatest element, thus it is trivially sorted.
For Insertion sort, you use the initial element and compare it to the previous element and swap if the current is larger than the previous. Using this sort, you will always perform n-1 comparisons where n is the total amount of elements in the array. Thus, there are only 11 iterations for a 12 element array.
Cheers.
Answer:
<h2>YEET B </h2>
Explanation:
Sorry
Its B: a type of what-if analysis that allows a user to define multiple variables for multiple functions or formulas
(i think)
Computer language is essential
Hey just a word of advice I hope you find someone lovely and someone who’ll enjoy you for you. Don’t look for people on apps like this I made many mistakes and it’s not smart. Have a good day. I get the feeling of loneliness and it sucks
