Status: Tags: #archivedCards/macm101/combinatorics Links: MACM101 Outline
Combinatorics
- Study of arrangement
Uses
-
Discrete probability
- ex) Chances of guessing a 6-symbol password
-
Analysis of algorithms: Why a comparison sort algorithm cannot be more efficient than O(n log n)?
-
Probabilistic proofs: Show that the local search algorithm with high probability does not find a good solution to a problem
Cheat Sheet
PracticeQ
https://www.math.tamu.edu/~mayaj/Chapter6_Sec6.4_f17mwcompleted.pdf
Backlinks
|
|
References:
Created:: 2021-11-04 08:34