A truth table with three inputs has how many switch combinations?
1 answer:
You might be interested in
Answer:
The correct answer to the following question will be "Θ(n2)
". The further explanation is given below.
Explanation:
If we're to show all the objects that exist from either the first as well as the second vector, though not all of them, so we'll have to cycle around the first vector, so we'll have to match all the objects with the second one.
So,
This one takes:
=
And then the same manner compared again first with the second one, this takes.
=
Therefore the total complexity,
= Θ(n2)