2c03-review - 00038

2c03-review - 00038 - 20 21 25 30 40 16 74 0 3 5 7 8 10 10...

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

View Full Document Right Arrow Icon
7 2 0 2 1 delete(16) delete(20) 21 30 25 30 25 74 40 40 74 2 5 3 0 delete(21) delete(25) 40 30 40 74 74 4 0 delete(30) delete(40) delete(74) 74 74 result: 0, 3, 5, 7, 8, 10, 10, 10, 11, 12, 13, 16, 20, 21, 25, 30, 40, 74 non-recursive 2-way merge: 5 11 20 8 13 10 25 7 30 12 10 40 0 3 10 21 16 74 5 11 8 20 10 13 7 25 12 30 10 40 0 3 10 21 16 74 5 8 11 20 7 10 13 25 10 12 30 40 0 3 10 21 16 74 5 7 8 10 11 13 20 25 0 3 10 10 12 21 30 40 16 74 0 3 5 7 8 10 10 10 11 12 13
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 20 21 25 30 40 16 74 0 3 5 7 8 10 10 10 11 12 13 16 20 21 25 30 40 74 recursive 2-way merge: 5 11 20 8 13 10 25 7 30 12 10 40 0 3 10 21 16 74 5 11 20 8 13 10 25 7 30 12 10 40 0 3 10 21 16 74 5 11 20 8 13 10 25 7 30 10 12 40 0 3 10 21 16 74 5 8 11 13 20 7 10 25 30 0 3 10 12 40 10 16 21 74 5 7 8 10 11 13 20 25 30 0 3 10 10 12 16 21 40 74 0 3 5 7 8 10 10 10 11 12 13 16 20 21 25 30 40 74...
View Full Document

This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.

Ask a homework question - tutors are online