Mainly there are three types based on the working nature of the Algorithms. Every student who learns algorithm should be familiar with the taxonomy. The types are :
1. Las Vegas Algorithms:
->An algorithm whose running time may change but always gives correct output is called as Las Vegas Algorithm.
for example : Randomized Quicksort.
2. Randomized Algorithms:
->which employs a degree of randomness. We can characterised acceptable algorithm based on bound the probability that any "bad" thing may happen. So running time and output is random.
3, Monte Carlo Algorithms:
->Actually it's a type of randomized algorithm whose running time can be determined but output may be incorrect in certain probabilities.
- Las Vegas Algorithms
- Randomized Algorithms
- Monte Carlo Algorithms
 |
| Algorithms |
1. Las Vegas Algorithms:
->An algorithm whose running time may change but always gives correct output is called as Las Vegas Algorithm.
for example : Randomized Quicksort.
2. Randomized Algorithms:
->which employs a degree of randomness. We can characterised acceptable algorithm based on bound the probability that any "bad" thing may happen. So running time and output is random.
3, Monte Carlo Algorithms:
->Actually it's a type of randomized algorithm whose running time can be determined but output may be incorrect in certain probabilities.
0 comments:
Post a Comment