1 / 13

Computing p()’s in O(n) time

Computing p()’s in O(n) time. P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8). Computing p()’s in O(n) time.

dorothylarson
Télécharger la présentation

Computing p()’s in O(n) time

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. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) chapter25

  2. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) chapter25

  3. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) chapter25

  4. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c. chapter25

  5. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c. chapter25

  6. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c. chapter25

  7. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c, p( c )=b. chapter25

  8. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c, p( c )=b. chapter25

  9. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c, p( c )=b, p(e)=a. chapter25

  10. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c, p( c )=b, p(e)=a. chapter25

  11. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c, p( c )=b, p(e)=a. chapter25

  12. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c, p( c )=b, p(e)=a, p(a)=0. chapter25

  13. Computing p()’s in O(n) time P()’s can be computed in O(n) time using two sorted lists, one sorted by finish time and the other sorted by start time. Start time: b(0, 5), a(1, 3), e(3, 8), c(5, 6), d(6, 8) Finish time a(1, 3), b(0,5), c(5,6), d(6,8), e(3,8) P(d)=c, p( c )=b, p(e)=a, p(a)=0, p(b)=0. chapter25

More Related