POL208Y1 Lecture : Regional & Global Governance

24. Consider the Insertion Sort (code 3) algorithm described in the appendix. How can we change this code to have the algorithm sort from largest to smallest instead? (A) Change line 9 to: a[j-1] = a[j]; (B) Change line 7 to: while(j >0 && a[j - 1] 0; i--) (E) Change line 12 to: a[i] = x;

which line in the following program will cause a compiler error?

4. 18 marks] Consider the following Scheme code: idefine (eval vi v2) (cora (and (> vl 0) (> V2 C)) (+ vl v2) 2)1 [(or 1> v! 0) (> v2 O)) (max v: v2) [else 'regative-valcos:)) a) [2 marks Write the contract for eval. b) [2 marks) Write a purpose for eval. c) 14 marks Write 4 separate, distinct tests for eval. (check-expect (check-expect (check-expect (check-expoco