10.3.0 • Published 2 years ago
comp-sci-maths-lib v10.3.0
Algorithms
This contains implementations of all the algorithms required by the OCR A Level Computer Science Specification
Sorting Algorithms
- Bubble Sort
- Insertion Sort
- Merge Sort
- Quick Sort
Searching Algorithms
- Linear Search
- Binary Search
Routing Algorithms
- Dijkstra's Shortest Path
- A* Algorithm
Graph Traversal
- Binary Trees: In Order, Pre Order, Post Order
- Graphs: Depth First, Breadth First
Maths
It also guest stars some algorithms from Secondary Maths
- Sieve of Eratosthenes (Prime Number generation)
Spec Contents for 2.3.1 Algorithms
Algorithms for the main data structures, (stacks, queues, trees, linked lists, depth-first (post-order) and breadth-first traversal of trees).
Standard algorithms (bubble sort, insertion sort, merge sort, quick sort, Dijkstra’s shortest path algorithm, A* algorithm, binary search and linear search).
10.1.0
2 years ago
10.2.0
2 years ago
10.3.0
2 years ago
10.0.1
3 years ago
10.0.0
3 years ago
9.3.4
3 years ago
9.3.3
3 years ago
9.3.2
3 years ago
9.3.0
3 years ago
9.2.0
3 years ago
9.1.3
3 years ago
9.1.2
3 years ago
9.1.1
3 years ago
9.1.0
3 years ago
9.0.1
3 years ago
9.0.0
3 years ago
8.0.1
3 years ago
8.0.0
3 years ago
7.1.0
3 years ago
7.0.1
3 years ago
7.0.0
3 years ago
6.0.0
4 years ago
5.4.0
4 years ago
5.3.0
4 years ago
5.2.0
4 years ago