Which of the following algorithms are probably correct as well as fast?
(a) Las Vegas Algorithm
(b) Monte Carlo Algorithm
(c) Atlantic City Algorithm
(d) All of the mentioned
I had been asked this question in an internship interview.
Enquiry is from Randomized Algorithm topic in section Other Classes Of Problems of Automata Theory