Searching and sorting algorithms

List view

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.

[2]

Searching and sorting algorithms Questions

Practise OCR GCSE Computer Science Searching and sorting algorithms with exam-style questions for GCSE Computer Science. 36 questions, matched to the OCR GCSE Computer Science (J277) specification and written in Component 01 and Component 02 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.