Randomized Algorithms in Bioinformatics: RANDOMIZEDCAMSORT
Abstract
Randomized algorithms make random decisions throughout their operation. At first glance, making random decisions does not seem particularly helpful. Basing an algorithm on random decisions sounds like a recipe for disaster, but the fact that a randomized algorithm undertakes a nondeterministic sequence of operations often means that, unlike deterministic algorithms; no input can reliably produce worst-case results. (Karp 1991). Randomized algorithms are often used in hard problems where an exact, polynomial-time algorithm is not known. In this paper we will see how randomized algorithms solve the Sorting problems.
Full Text:
PDFDOI: http://dx.doi.org/10.21533/scjournal.v2i2.34
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 SouthEast Europe Journal of Soft Computing
ISSN 2233 -1859
Digital Object Identifier DOI: 10.21533/scjournal
This work is licensed under a Creative Commons Attribution 4.0 International License