Notation
⌊x⌋ floor function largest integer less than or equal to x
⌈x⌉ ceiling function smallest integer greater than or equal to x
{x} fractional part x – ⌊x⌋
lgN binary logarithm log2N
lnN natural logarithm logeN
binomial coefficient number of ways to choose k out of n items
Stirling number of the first kind number of permutations of n elements that have k cycles
Get An Introduction to the Analysis of Algorithms, Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.