Not at all, many classical algorithms and data structures are and must be probabilistic. Classical quicksort/quickselect is the best example.
I think it's just a case of the case being easier to argue this way.
Not at all, many classical algorithms and data structures are and must be probabilistic. Classical quicksort/quickselect is the best example.
I think it's just a case of the case being easier to argue this way.