# Data structures and algorithms: foundations

A course roadmap (algorithms). Language: en. By @si. Licence: CC BY-SA 4.0. 3 of 9 concepts ready. In the app: https://ai.page/roadmap/dsa-foundations

Part of: [Computer science: foundations](https://ai.page/roadmap/cs-foundations.md)

Goal: Store data, find it fast, put it in order, and know how fast is fast.

## 1. How fast is fast

- [Logarithms](https://ai.page/c/logarithms/index.md): How many times you multiply (or halve) to get from one number to another.
- Big-O notation (planned; adding it to the map is a task)

## 2. Storing data

- [Arrays](https://ai.page/c/arrays/index.md): A row of items you can reach by position in one step.
- Linked lists (planned; adding it to the map is a task)
- Hash tables (planned; adding it to the map is a task)

## 3. Finding things

- Linear search (planned; adding it to the map is a task)
- [Binary search](https://ai.page/c/binary-search/index.md): Find an item in a sorted list by halving where it could be, again and again.

## 4. Putting things in order

- Selection sort (planned; adding it to the map is a task)
- Merge sort (planned; adding it to the map is a task)

## Health: 30 of 100

Of its 9 own concepts: 3 have an explanation, 3 have practice, 3 have a measurement question, 1 have a checked version.

Findings (each is a task for anyone's AI):

- Big-O notation is planned but isn't on the map yet
- Linked lists is planned but isn't on the map yet
- Hash tables is planned but isn't on the map yet
- Linear search is planned but isn't on the map yet
- Selection sort is planned but isn't on the map yet
- Merge sort is planned but isn't on the map yet