Abstract
Discrete probability is introduced as a method to estimate average cases, not to predict individual outcomes from a process subject to chance or unpredictability, like flipping a coin or rolling a die.
Basic definitions are given for the fundamental concepts: an experiment, a sample space, a probability function, events, independent events, conditional probability, random variables, and the expected value of a random variable. Expected value generalizes average value and is used for calculating the average-case complexity of algorithms.
Standard distributions, which are good models of many real-world processes including computer applications, are treated in some detail. These include the uniform distribution, the binomial distribution, and the geometric distribution.
This chapter ends with a proof that the average-case complexity of QuickSort is O(nlgn).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Jenkyns, T., Stephenson, B. (2018). Discrete Probability and Average-Case Complexity. In: Fundamentals of Discrete Math for Computer Science. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70151-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-70151-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70150-9
Online ISBN: 978-3-319-70151-6
eBook Packages: Computer ScienceComputer Science (R0)