Answer:
your on unit 9 of edhesive?
Explanation:
Answer:
I would like to stay anonymous while criticizing the current government. As there have been many cases when people who wrote against the government's decisions were caught by the police.
So I would prefer to stay anonymous while commenting on various government policies. My friends would know about it because I share my posts only with them.
The government can know about my identity by ordering the social networking site to reveal it.
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
Answer:
int a[10] = {10,20,30,40,50,60,70,80,90,100};
Explanation:
In the above statement, we declare the integer data type array variable that is 'a' then, pass its index value that is 10 which means it contains only 10 values and initialize the components of the array variable that is starting with 10 and end at 100 in the difference of 10. So, the following declaration is correct according to the statement.
Answer:
<h2>C- rippled</h2><h2>O- utstanding</h2><h2>M- agical</h2><h2>P- eace</h2><h2>U- npredictable</h2><h2>T- riumph</h2><h2>E - xcellent</h2><h2>R- obust</h2>
Explanation:
<h3><u>Acronym</u>- a word that composes of long words that start with its initial letter.</h3><h3>Example: OTG (on the go)</h3>
