Skip to content

Course home

Algorithms

Algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
Question 51

A flight booking system uses the following algorithm to sort flight data:

# flightDirectory has the format [flightNumber, destination, passengers]

PROCEDURE bubbleSortFlights()
    SET temporary TO []
    FOR outer FROM 0 TO LENGTH(flightDirectory) - 1 DO
        FOR inner FROM 0 TO LENGTH(flightDirectory) - 2 DO
            IF flightDirectory[inner, 2] > flightDirectory[inner + 1, 2] THEN
                SET temporary TO flightDirectory[inner]
                SET flightDirectory[inner] TO flightDirectory[inner + 1]
                SET flightDirectory[inner + 1] TO temporary
            END IF
        END FOR
    END FOR
END PROCEDURE

State the specific type of data structure represented by flightDirectory in this algorithm.

[1]
Markscheme

Algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Algorithms

159 exam-style questions on Edexcel GCSE Computer Science Algorithms, covering Constructs for solving problems, Variables, constants and data structures, Arithmetic, relational and logical operators, Tracing algorithm output with trace tables, Types of error and correcting logic errors, Standard algorithms (sorts and searches), and Evaluating algorithm fitness and efficiency. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank