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:
photoshop app that purchase with a lower price 3$ per month
Answer:
oh sorry i needed points but i have a friend whos user starts with dida
Explanation:
Well we have SRAM(Static Random Access Memory) is faster, have a lower density but it is more expensive.
While DRAM(Dynamic Random access memory) is just the opposite.
Those are the only two, I know exist.
