All of the answers above are correct
Answer:
Code works perfectly
Explanation:
There is nothing wrong with your program as it runs perfectly and displays the expected results.
You may need to compile with another compiler if you're not getting the required results.
I've added the source code as an attachment (unedited)
Boolean operators it is
all the best
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.
Answer:
120
Explanation:
This question is basically asking how many ways can we arrange 5 sizes of shirts if they come in 4 colors.
5 permutation of 4
To find permutation, we use the formula
P(n, r) = n! / (n - r)!
Where
n is the size of the shirts available, 5
r is the color of each shirt available, 4
P(5, 4) = 5! / (5 - 4)!
P(5, 4) = (5 * 4 * 3 * 2 * 1) / 1!
P(5, 4) = 120 / 1
P(5, 4) = 120
Therefore, the total number of shirts available is 120
