LAS VEGAS:算法第一种定义：永远正确 The first approach says that a randomized algorithm A is a Las Vegas algorithm computing a problem F if for any input instance x of F, Prob(A(x)=F(x))=1, where F(x)is the solution of F for the input instance z.For this definition the time complexity of A is always considered to be the expected time complexity Exp-TimeA(n). 永远正确 不以worst case为代表 来讨论时间开销LAS VEGAS算法第一种定义:永远正确 永远正确 不以worst case为代表 来讨论时间开销