The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
<h3>What is time complexity of data structures?</h3>
Time Complexity of an algorithm is known to be the depiction of the amount of time needed by the algorithm to carry out to completion.
Note that The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
Learn more about data from
brainly.com/question/17350816
#SPJ1
Answer:
FALSE....john has no idea what hes talking about. i knew this was false yet i looked it up and got it wrong anyway because of john its freaking false
Explanation:
Answer:
Post advertisements on social media and message the subscribers.
Explanation:
There is no point in not promoting and putting forward the work that he has been doing. All of the given options are about promoting the content but Sam needs to choose the ones which are efficient and seem professional as well.
Posting advertisements about the website promotes the content on a wider base and helps in luring more and more people to the website.
Messaging or sending an email to the subscribers is a healthy of letting the subscribers about the updates and latest posts.