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 !!!
Session Initiation Protocol, brainliest ?
Because it is a very fun game and if it is fun people like it
The connector for ethernet cables is called RJ45. for phone jack is RJ11. Although they look the same, the RJ11 has only 4 leads, as opposed to 9 leads in RJ45. Also, RJ11 is not as wide as RJ45, so the connector does not fit.
Even if it would, the signals would be totally incompatible, so no success can be expected.