Design Analysis and Algorithm

A₁ amortized cost Analysis apply assignment asymptotically augmenting path B-tree binomial heap binomial tree C₁ C₂ color Comparison compute contains d₁ data structure define deletion dynamic programming edge element Example fibonacci heap Fractional Knapsack problem graph G greedy algorithm H₁ H₂ Hamiltonian cycle heap H Heapify implementation input Insert integer iteration knapsack problem Kruskal's algorithm leaf length Line loop Match found maximum merge sort min H minimum spanning tree mis match next-x node NP-Complete O-notation operation optimal solution optimal substructure partition pattern Pivot pointer polynomial polynomial-time Prim's algorithm procedure Quick sort randomized red black tree red-black tree root list running search tree sequence shortest path sibling solve sort algorithm Step string subproblems subset subtree Swap undirected graph upper bound V₁ V₂ vertex cover vertices weight