This preview shows page 1. Sign up to view the full content.
Unformatted text preview: or end times, but the start time and end time of two jobs can overlap. 2. Describe and analyze an algorithm that chooses one element uniformly at random from a data stream, without knowing the length of the stream in advance. Your algorithm should spend O ( 1 ) time per stream element and use O ( 1 ) space (not counting the stream itself). 3. Design and analyze an algorithm that return a permutation of the integers { 1,2,. .., n } chosen uniformly at random. 1...
View Full
Document
 Fall '08
 Chekuri,C
 Algorithms

Click to edit the document details