CMPT 165 : CMPT165-ListsReviewWithAnswers.docx

9. After executing this code int a = 57; int b = 43; a b a a b a a b a += b; = a - b; -= b; += b; = a - b; -= b; += b; = a - b; -= b; the values of a and b will be swapped. (A) TRUE (B) FALSE

Part (a) [3 MARKS] Consider this program: Fill in the Python Shell output after this program has executed. >>> X L = [4, 10, 8] X = L. sort L.append(20) L2 = L[1:] >>> L >>> id(L) == id(L2)

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;