Answer:
c.O(n)
Explanation:
In the array based list implementation of the ADT the worst case time complexity of the getEntry method is O(n).In the worst case it has to travel upto n elements then it has to do the operation.In doing so the time complexity will come out to be O(n).So we conclude that the answer to this question is O(n).
Answer:
what
Explanation:
uhh this isnt complete or something i dont know what this is im gonna answer it for the points
Answer:
The complete program is as follows:
m_str = input('Input m: ')
mass = float(m_str)
e = mass * 300000000**2
print("e = ",e)
Explanation:
This is an unchanged part of the program
m_str = input('Input m: ')
This converts m_str to float
mass = float(m_str)
This calculates the energy, e
e = mass * 300000000**2
This is an unchanged part of the program
print("e = ",e)
