Combinatorics addresses the question of "how many ways" a task can be performed, forming the basis for probability and algorithm analysis.
Modern discrete math textbooks are behemoths—often 1,000+ pages. Liu’s book is roughly 350-400 pages. Students prefer a PDF because they can search, annotate, and carry the entire text on a laptop without back strain. liu elements of discrete mathematics pdf
This is the bridge chapter. Liu introduces the concept of an algorithm (informal but precise), complexity (Big-O notation), and recurrence relations. He walks through analyzing a simple sorting algorithm (e.g., insertion sort) to count operations. Combinatorics addresses the question of "how many ways"