Well if you add it up , if one cup of coffe is $1, then in one year it would be $365 on coffe.
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:
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cout<<"enter the value of a:";
cin>>a;
cout<<"enter the value of b:";
cin>>b;
cout<<"enter the value of c:";
cin>>c;
cout<<"product is:"<<(a*b*c);
return 0;
}
Explanation:
The answer to this question is A