For COMPSCI 590
Additional Reading Material
• Lower bound for sorting [Er:27]
• Expected-time analysis of Quick Sort [Ed:2]
• Strongly connected components [DPV:3.4]
• Treaps [Er:10.1]
Design & Analysis of Algorithms — COMPSCI 330 and COMPSCI 590 — Spring 2013
Additional Reading Material
• Lower bound for sorting [Er:27]
• Expected-time analysis of Quick Sort [Ed:2]
• Strongly connected components [DPV:3.4]
• Treaps [Er:10.1]