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:
d) daco = new Banana;
Explanation:
Dynamically allocated variables have their memory allocated in the heap memory.We declare a dynamical variable like this:-
int *a=new int ;
It means a pointer a is created on the stack memory which hold the address of the block that hold the value of variable a in heap memory.
We already have the pointer daco. We just have to initialize with keyword new.
It will be like daco=new Banana; which matches the option d.
Bluetooth connection data on nonvolatile storage media such as a USB