# ocr-cs-alevel-ts

> Collection of Algorithms and Data Structures Required by OCR A Level Computer Science

Latest version **5.1.0** (published 2020-08-04) · ISC license · 0 weekly downloads

## Install

```sh
npm install ocr-cs-alevel-ts
pnpm add ocr-cs-alevel-ts
yarn add ocr-cs-alevel-ts
bun add ocr-cs-alevel-ts
```

## Health

**Score 25/100 (F)** — status: abandoned.

Positive: has types; no vulnerabilities; high quality score.

Warnings: low downloads; no esm support.

Negative: abandoned; low maintenance score.

## Facts

| | |
|---|---|
| Version | 5.1.0 |
| Published | 2020-08-04 |
| First published | 2020-07-21 |
| Weekly downloads | 0 |
| License | ISC |
| TypeScript types | bundled |
| Module format | CommonJS |
| Node | >=12.16.x |
| Dependencies | 6 |
| Unpacked size | 204.6 KB |
| Known vulnerabilities | 0 |
| Install scripts | no |
| Maintainers | joesharp |

## Links

- npm: https://www.npmjs.com/package/ocr-cs-alevel-ts
- npm.io page: https://npm.io/package/ocr-cs-alevel-ts

## Dependencies (6)

- [jest](https://npm.io/package/jest.md) ^26.1.0
- [lodash](https://npm.io/package/lodash.md) ^4.17.19
- [tslint](https://npm.io/package/tslint.md) ^6.1.0
- [winston](https://npm.io/package/winston.md) ^3.2.1
- [@types/jest](https://npm.io/package/@types/jest.md) ^26.0.5
- [@types/lodash](https://npm.io/package/@types/lodash.md) ^4.14.149

## Recent versions

- 5.1.0 (latest) — 2020-08-04
- 5.0.1 — 2020-08-02
- 5.0.0 — 2020-08-02
- 4.0.0 — 2020-07-31
- 3.2.0 — 2020-07-28
- 3.1.0 — 2020-07-25
- 3.0.0 — 2020-07-25
- 2.3.0 — 2020-07-25
- 1.0.1 — 2020-07-21

## README

# 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).

---
_Source: https://npm.io/package/ocr-cs-alevel-ts · Machine-readable twin of the npm.io package page. Health data is recomputed on every publish._