Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
Answer:
The FIND function returns the position (as a number) of one text string inside another. If there is more than one occurrence of the search string, FIND returns the position of the first occurrence. FIND does not support wildcards, and is always case-sensitive.
Explanation:
Answer:
b.used is 2, b.data[0] is 4, b.data[1] is 6
Explanation:
bag b;
b.insert(5); // b has 5
b.insert(4); // b has 5,4
b.insert(6); // b has 5,4,6
b.erase_one(5); // now 5 is removed , b has 4,6
so no:of elements b.used is 2
b[0]=4;
b[1]=6;
To continue to look at motivational or inspirational quotes to remind them or to remember how far you have come and it is not time to give up!
By definition a computer is an electronic device used to store and compute data. So, by definition a calculator stores and interprets data/numbers, and that makes it a computer. However, a computer can also use programs, and manipulate stored data to complete those programs.
hope it helps!! :D
