Shell Sort Execution

A question is this type if and only if it asks the student to perform a Shell sort algorithm on a given list, showing the state after each pass.

3 questions · Easy -1.2

Sort by: Default | Easiest first | Hardest first
AQA D1 2012 January Q1
5 marks Easy -1.2
1 Use a Shell sort to rearrange the following numbers into ascending order, showing the new arrangement after each pass. \(\begin{array} { l l l l l l l l } 37 & 25 & 16 & 12 & 36 & 24 & 13 & 11 \end{array}\) (5 marks) PART REFERENCE REFERENCE
AQA D1 2013 January Q2
5 marks Easy -1.2
2
  1. Use a Shell sort to arrange the following numbers into ascending order. $$\begin{array} { l l l l l l l l } 7 & 8 & 1 & 6 & 3 & 4 & 5 & 2 \end{array}$$
  2. Write down the number of comparisons on the first pass.
AQA D1 2007 June Q2
8 marks Easy -1.2
2
  1. Use a Shell sort to rearrange the following numbers into ascending order, showing the new arrangement after each pass. $$\begin{array} { l l l l l l l l } 28 & 22 & 20 & 17 & 14 & 11 & 6 & 5 \end{array}$$
    1. Write down the number of comparisons on the first pass.
    2. Write down the number of swaps on the first pass.
  3. Find the total number of comparisons needed to rearrange the original list of 8 numbers into ascending order using a shuttle sort.
    (You do not need to perform a shuttle sort.)