1 / 22

Hint for Homework 1

This helpful hint provides guidance for solving problems related to sorting algorithms, divide-and-conquer techniques, and planar graph separators. It includes hints for specific problems and useful information on topics such as longest increasing subsequence, the Tarjan-Lipton Theorem, and Dijkstra's algorithm.

aaustin
Télécharger la présentation

Hint for Homework 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Hint for Homework 1 Sorting and Divide-and-Conquer

  2. Hint for Problem 1 not work !!!

  3. Hint for Problem 4

  4. Why?

  5. Hint for Problem 6

  6. Hint for Problem 7

  7. Hint for Problem 8 (2) (3)

  8. Longest increasing subsequence

  9. Planar Graph Separator Tarjan-Lipton Theorem (1979)

  10. Application

  11. Example Dijkstra’s algorithm can find the shortest path from s to t in time O((n+m) log n) where n is # of nodes and m is # of edges.

  12. Planar Graph induction Exercise

  13. Running Time

  14. A Search Problem

More Related