CS 240- Final Exam Guide - Comprehensive Notes for the exam ( 198 pages long!)

• School: University of Waterloo
• Department: Computer Science
• Course: CS240
• Professor: Lesley Istead

Document Summary

6 i = (n i=1 n i=1 n i. 1 6 i=1 i = 6 2 ( n. 2 + 3 = 3 2 3 n n) n. 4 i = (j i=1 n n i=1 j=i. 3 n n (4 (j j=i n. I = i=1 (4( n j=i n j j=i i. Illustrate same sequence of insert deletemax using unsorted array: insert( 1 ) : 1 insert( 5 ) : 1 5 insert( 3 ) : 1 5 3 deletemax( ) : 1 3 5 deletemax( ) : 1 3 insert( 2 ) : 1 2 deletemax: Assume ascending order, so largest element is last/rightmost element in array. insert( 1 ) : 1 insert( 5 ) : 1 5 insert( 3 ) : 1 3 5 deletemax( ) : 1 3 5 deletemax( ) : 1 3 insert( 2 ) : 1 2 deletemax: