If a read and a write each take one cme step and

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: - sequences intermi@ently two one of its output streams. Sm reads two sorted sub- sequences, one from each input stream, merges these and produces the resulCng output sequence. If a read and a write each take one Cme step and internal computaCon takes 0 Cme: 1. How many sorters are needed to sort n numbers? 2. How many 7me steps does it take to sort n numbers? 3. Is this algorithm cost op7mal? 2|1|66|82 3 1...
View Full Document

This note was uploaded on 02/12/2014 for the course CS 475 taught by Professor Staff during the Fall '08 term at Colorado State.

Ask a homework question - tutors are online