Answer:
In ADT graph the efficiency of addVertex has efficiency O(logn).
Explanation:
The time complexity of the method addvertex in ADT graph is O(logn). addVertex method has time complexity of O(logn) because it has to divide the list in half and add the vertex according to the place where the needs to be added.
hence we conclude that the answer is O(logn).
Well, if you want to, make sure it's safe.
I don't know what RAM really is, but check if it's safe first. And maybe talk it out with your parents.
That's all I gotta say!
Answer:
There are two ways to print 1 to 1000
- Using Loops.
- Using Recursion.
Explanation:
Using loops
for(int i=1;i<=1000;i++)
{
cout<<i<<" ";
}
Using recursion
Remember you can implement recursion using a function only.
void print(int n)
{
if(n==0)
return;
print(n-1);
cout<<n<<" "';
}
you should pass 1000 as an argument to the function print.