Pay your bills and don't be late
Answer:
Following is attached solution to each part. I hope it will help you!
Explanation:
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:
C
Explanation:
ive been doing this same one so its C
Answer:
Alice's public key
Explanation:A Public key is a key that can be used for verifying digital signatures generated using a corresponding private key which must have been sent to the user by the owner of the digital signature.
Public keys are made available to everyone required and they made up of long random numbers.
A digital signature signed with a person's private key can only be verified using the person's private key.
