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.
Earth is natural and technology has a thing that can make u sick
Answer:
True
Explanation:
When using databases in a project, not everyone has the same access level, e.g the database admin may have the highest level of access (access to data on live mode), the software testers have their own level of access (access to data on test mode) and so on.
Answer:
false
Explanation:
i believe the right term is error
