Answer:
Quick Sort.
Explanation:
Quick Sort will be best suited for an array having 100000 elements instead of the insertion sort algorithm because as we know the average time complexity of quick sort is O(NlogN) and for insertion sort is O(n^2).The sorting totally depends upon the pivot that is being selected in quick sort.
While insertion sort is best suited for arrays that are already sorted it takes O(n) time in those cases.
Since the array that we have is very large and so we need an algorithm that can sort the array faster than the other sorting algorithms.Quick Sort is also inplace and does not requires extra space to do the sorting.
Answer:
Does it look a bit weird?
36% is the answer to your question.
Answer:
signal repeaters.
Explanation:
The best device to use in this scenario would be signal repeaters. These basically grab an already existing signal and repeats it in a specific direction therefore amplifying the range. These devices are usually used when a large network system is not reaching certain devices that are located too far away. These devices are then placed in midpoints between the network and the device and aimed towards the direction of the device. It then picks up the existing signal and retransmits it to the devices' location so that the device can pick up the network signal and access it.
