____________ is one of the most useful principles of enumeration in combinationatorics and discrete probability.
(a) Inclusion-exclusion principle
(b) Quick search algorithm
(c) Euclid’s algorithm
(d) Set theory
The question was asked in an interview for job.
The above asked question is from Number Theory topic in division Number Theory of Data Structures & Algorithms II