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.
I would say C , Supercomputer
False you want to use the best lenses and settings as very fine details can't be edited plus let's be real no one wants to sit for three hours editing one photo
Answer:
Hi there! The question is checking your knowledge on Pseudocode. Pseudocode is a high level solution written in plain English to outline the steps needed for the program to work correctly. An implementation for the different parts of the question is written below.
Explanation:
1. Determine the area of a triangle
declare formula for area calculation of triangle as ½ * (base * height)
validate input parameters “base” and “height”
apply formula and return result
2. Compute the interest earned Prompt user for input 2
declare formula for interest calculation as annual interest rate * term * starting account balance
validate input parameters “interest_rate” and “starting_account_balance ”
apply formula and return result as final balance at the end of the year as the interest earned + starting balance.
3. Determine the flying time between two cities given the mileage M between them and the average speed of the airplane.
declare formula for time calculation of triangle as time = distance / speed
validate input parameters for mileage “M” and speed “S”
apply formula and return result