Answer: Provided in the explanation section
Explanation:
The question to this problem says;
Question:
I am sorting data that is stored over a network connection. Based on the properties of that connection, it is extremely expensive to "swap" two elements. But looping over the elements and looking at their values is very inexpensive. I want to minimize swaps above all other factors. Choose the sorting algorithm we studied that will perform the best:
ANSWER
1. Merge Sort
Because merge sort uses additional memory instead of swapping the elements.
2. Merge Sort and Quick Sort both can be used with multi processor.
cheers i hope this helps !!!
Answer:
An error will be occurred here. In C++ a function must be like
returntype function_name(){
}
but the functions in given class does not have returntype given. So there will be a syntax error.
If the returntype is defined then the code does not show any output since nothing is printed in the main function.
Answer:
google kis kam ka hai us se puch lo
