Answer:
Option D is the correct answer.
Explanation:
Answer:
(a) scope: function, lifetime: duration of the function
(b) scope: function, lifetime: duration of the program
(c) scope: global (all modules), lifetime: duration of the program
(d) scope: module (file), lifetime: duration of the program
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:
Centralisation
dashboard , programmatic access
Explanation:
hope it helps u
mark me as brainlist
