Computing p()

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)
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)
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)
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.