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 !!!
i dont have enough information to awnser this
When somebody writes the answer for your question and posts it on your question it will show a “(crown)mark as brainliest” in blue. click it and it’ll turn yellow and mark the person the brainliest for your question
They may invade privacy rights of air space and be used for other unintended acts such a bombings and espionage
