PART A

Questions $1$ and $2$ of part A uses the following sorted array:

$\backslash$table$[[9,11,14,16,17,19,20,22,24,33,35]]$

A$\mathrm{.}1.[2$ marks$]$ Suppose you are doing a sequential search on this sorted array; how many comparisons would you need to do in order to find the value $17?$

$$ In order to find the value of $17$ we will nad to do $4$ comparisons

A$\mathrm{.}2.[6$ marks$]$ Suppose you are doing a binary search; how many comparisons would you need to do in order to find each of the following values:

a$)9$

Answer: $8$

b$)22$

Answer:

c$)24$

Answer:

A$\mathrm{.}3.[6$ marks$]$ Suppose you have the following array of numbers to sort. What are the partially sorted lists after $1,2$ and $3$ complete passes $($iterations$)$ of Insertion sort?

$\backslash$table$[[7],[15],[4],[6],[10],[5],[3],[16],[12],[11]]$