{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CSE5311M2 - CSE5311 Module 2 This Class Heaps and Heapsort...

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CSE5311 – Module 2 This Class At the end of the class Heaps and Heapsort? – QuickSort – Mergesort Other Sorting Algorithms At the end of the class Binary trees Priority queues and heaps Quicksort Worstcase Bestcase 8/30/2009 M KUMAR CSE5311 1 Mergesort Recurrences for Quicksort and Mergesort Further Reading Reference books on Algorithms Course Syllabus Review of Asymptotic Analysis and Growth of Functions, Recurrences Sorting Algorithms Graphs and Graph Algorithms . Greedy Algorithms : Minimum spanning tree,Union-Find algorithms, Kruskal's Algorithm, Clustering, Huffman Codes, and Multiphase greedy algorithms. Dynamic Programming : Shortest paths, negative cycles, matrix chain multiplications, sequence alignment, RNA secondary structure, application examples. Network Flow : Maximum flow problem, Ford-Fulkerson algorithm, augmenting paths, Bipartite matching problem, disjoint paths and application problems . 8/30/2009 M KUMAR CSE5311 2 NP and Computational tractability : Polynomial time reductions; The Satisfiability problem; NP-Complete problems; and Extending limits of tractability. Approximation Algorithms, Local Search and Randomized Algorithms
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon