Answer:
Open a document: Ctrl + O.
Create a new document: Ctrl + N.
Save the current document: Ctrl + S.
Open the Save As window: F12.
Close the current document: Ctrl + W.
Split the window: Alt + Ctrl + S.
Copy: Ctrl+C
Paste: Ctrl+V
Cut the current selection: Ctrl + X
Copy the current selection: Ctrl + C
Paste the contents of the clipboard: Ctrl + V
Bold: Ctrl + B
Italics: Ctrl + I
Underline: Ctrl + U
Underline words only: Ctrl + Shift + W
Center: Ctrl + E
Make the font smaller: Ctrl + [
Make the font bigger: Ctrl + ]
Change text to uppercase: Ctrl + Shift + A
Change text to lowercase: Ctrl + Shift K
Insert a page break: Ctrl + Enter
Add a hyperlink: Ctrl + K
Explanation:
Explanation:
hope this helps to uhh...
Answer:
Check the explanation
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] {
what this means is that the size of nut is lesser than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
what this means is that the size of bolt is lesser 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.
