Answer:
if(y==10)
{
x=0; // assigning 0 to x if y equals 10.
}
else
{
x=1; // assigning 1 to x otherwise.
}
Explanation:
In the if statement i have used equal operator == which returns true if value to it's right is equal to value to it's left otherwise false.By using this operator checking value of y and if it is 10 assigning 0 to x and if it is false assigning 1 to x.
The answer is A. For example, you could start at slide 8 and jump to slide 2 and then to 3. It does not follow and linear structure!!
Answer:
O(n²)
Explanation:
The worse case time complexity of insertion sort using binary search for positioning of data would be O(n²).
This is due to the fact that there are quite a number of series of swapping operations that are needed to handle each insertion.
I think (a) is the answer because this is the screen that it should open when u use it
