An insertion sort is one type of sorting algorithm.
A programmer designs a pseudocode algorithm to sort a 1D array of product components, products, into alphabetical order.
products = ["Beta", "Alpha", "Delta", "Gamma", "Epsilon"]
for i = 1 to products.length - 1
index = i
while (index > 0 and products[index] < products[index - 1])
hold = products[index]
products[index] = products[index - 1]
products[index - 1] = hold
index = index - 1
endwhile
next i
Describe the purpose of the variable hold in this algorithm.
36 exam-style questions on OCR GCSE Computer Science Searching and sorting algorithms. Each one has a worked solution and a mark scheme showing where the marks go.