Editing Randomized Algorithms (section)

== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Randomized Algorithm''' — An algorithm that employs a degree of "Randomness" as part of its logic.
* '''Monte Carlo Algorithm''' — An algorithm that is "Always Fast" but has a "Small chance" of being "Wrong." (Used when 'Speed' is more important than 'Absolute Truth').
* '''Las Vegas Algorithm''' — An algorithm that is "Always Correct" but might take a "Randomly long time" to finish. (Used when 'Truth' is non-negotiable).
* '''Deterministic Algorithm''' — A traditional algorithm that "Always" behaves the same way for the same input.
* '''Probability of Error (Epsilon)''' — The "Calculated risk" that a Monte Carlo algorithm will give the wrong answer (usually designed to be tiny, like 1 in a billion).
* '''Quicksort (Randomized)''' — A famous sorting algorithm that "Picks a random pivot" to avoid "Worst-case" slowness, making it one of the "Fastest" ways to sort data in the world.
* '''Miller-Rabin Primality Test''' — A randomized way to check if a "Giant Number" is "Prime," which is the "Secret Sauce" of modern "Cryptography."
* '''Random Walk''' — A process where the machine "Moves randomly" to "Explore" a space (e.g., 'Google PageRank' or 'Robot Vacuum cleaners').
* '''Hashing''' — Using "Randomness" (or pseudo-randomness) to "Distribute" data evenly across a memory map to prevent "Clashes."
* '''Derandomization''' — The "High-Level" math of "Removing the coins" from an algorithm once you have found the "Pattern of Success."
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">