Answer:
answer a
Explanation:
sorry it’s for the points
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
Answer:
There is also an attachment below
Explanation:
Since we are talking about binary search, let's assume that the items are sorted according to some criteria.
Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.
N = 700000000.
So, number of comparisions can be log(N) = 29.3 = 29.
So, in the worst case it does comparisions 29 times
Answer:
yessss I tooo have a fire at my home
lolololololololololo
ok have a great day what is your name ?
