You put the dash on the right side up top ape
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
Answer:
B. 1 6 3
Explanation:
Given function definition for calc:
void calc (int a, int& b)
{
int c;
c = a + 2;
a = a * 3;
b = c + a;
}
Function invocation:
x = 1;
y = 2;
z = 3;
calc(x, y);
cout << x << " " << y << " " << z << endl;
- Since x is passed by value, its value remains 1.
- y is passed by reference to the function calc(x,y);
Tracing the function execution:
c=3
a=3
b=c+a = 6;
But b actually corresponds to y. So y=6 after function call.
- Since z is not involved in function call, its value remain 3.
So output: 1 6 3
Social media is the high capacity of communication links
