OCR A Level Computer Science

2.3: Algorithms

Revision tools
You can print this page for a quick reference guide or you can use the tools below to create printable test sheets
2.3.1a: Analysis and design of algorithms for a given situation.
Algorithms
KeywordDefinition
2.3.1b: The suitability of different algorithms for a given task and data set, in terms of execution time and space
Algorithms
KeywordDefinition
2.3.1c: Measures and methods to determine the efficiency of different algorithms, Big O notation constant, linear, polynomial, exponential and logarithmic complexity.
Algorithms
KeywordDefinition
2.3.1d: Comparison of the complexity of algorithms.
Algorithms
KeywordDefinition
2.3.1e: Algorithms for the main data structures, stacks, queues, trees, linked lists, depth-first post-order and breadth-first traversal of trees
Algorithms
KeywordDefinition
2.3.1f.a: Standard algorithms bubble sort
Algorithms
KeywordDefinition
2.3.1f.b: Standard algorithm for insertion sort
Algorithms
KeywordDefinition
2.3.1f.c: Standard algorithm for merge sort
Algorithms
KeywordDefinition
2.3.1f.d: Standard algorithm for quick sort
Algorithms
KeywordDefinition
2.3.1f.e: Standard algorithm for Dijkstra's shortest path
Algorithms
KeywordDefinition
2.3.1f.f: Standard algorithm for A* algorithm
Algorithms
KeywordDefinition
2.3.1f.g: Standard algorithm for binary search
Algorithms
KeywordDefinition
2.3.1f.h: Standard algorithm for linear search
Algorithms
KeywordDefinition