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 x.For this definition the time complexity of A is always considered to be the expected time complexity Ep-TimeA(n). 一定给出正确（最优）解 不以worst case为代表 来讨论时间开销LAS VEGAS算法第一种定义 一定给出正确(最优)解 不以worst case为代表 来讨论时间开销