# thealgorithms/c architecture

> Architecture diagram of the GitHub repository thealgorithms/c, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-11-09). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/thealgorithms/c
- Repository: https://github.com/thealgorithms/c

## Overview

The Algorithms in C is a learning-oriented collection of independent, portable C implementations spanning computer science, mathematics, statistics, data science, and engineering. A user selects and runs an individual implementation; the repository does not describe a single cross-module runtime pipeline. The map groups its major algorithm domains and highlights sampled modules and required core headers. Relationships between independent examples are intentionally omitted; unsampled areas are represented at their existing directory paths.

Main entry points: [`client_server`](https://github.com/thealgorithms/c/tree/master/client_server) (Client-server examples), [`geometry/vectors_3d.c`](https://github.com/thealgorithms/c/blob/master/geometry/vectors_3d.c) (3D vectors), [`numerical_methods/qr_eigen_values.c`](https://github.com/thealgorithms/c/blob/master/numerical_methods/qr_eigen_values.c) (QR eigenvalues), [`client_server/fork.h`](https://github.com/thealgorithms/c/blob/master/client_server/fork.h) (Fork compatibility)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_algorithms["Algorithm domains"]
  node_sorting["Sorting"]
  node_searching["Searching"]
  node_conversions["Conversions"]
  node_dynamic_programming["Dynamic programming"]
  node_leetcode["LeetCode solutions"]
  node_greedy["Greedy algorithms"]
  node_misc["Other algorithms"]
  node_exercism["Exercism exercises"]
  node_project_euler["Project Euler"]
end

subgraph group_structures["Data structures"]
  node_data_structures["Data structures"]
  node_dynamic_array["Dynamic array<br/>[dynamic_array.h]"]
  node_hash_set["Hash set<br/>[hash_set.h]"]
  node_list["List<br/>[list.h]"]
  node_linked_stack["Linked stack<br/>[stack.h]"]
end

subgraph group_applied["Applied computing"]
  node_audio["Audio"]
  node_cipher["Ciphers"]
  node_hash["Hash algorithms"]
  node_machine_learning["Machine learning"]
  node_games["Games"]
  node_scheduling["Process scheduling"]
end

subgraph group_networking["Network examples"]
  node_client_server["Client-server examples"]
  node_fork_compat["Fork compatibility<br/>[fork.h]"]
  node_bool_header["Boolean header<br/>[bool.h]"]
end

subgraph group_numeric["Math and geometry"]
  node_geometry["Geometry"]
  node_vectors_3d["3D vectors<br/>[vectors_3d.c]"]
  node_numerical_methods["Numerical methods"]
  node_qr_decompose["QR decomposition<br/>[qr_decompose.h]"]
  node_qr_eigenvalues["QR eigenvalues<br/>[qr_eigen_values.c]"]
  node_math["Mathematics"]
end

node_client_server -->|"uses on Windows"| node_fork_compat
node_vectors_3d -->|"uses types"| node_geometry
node_qr_eigenvalues -->|"calls decomposition"| node_qr_decompose

click node_sorting "https://github.com/thealgorithms/c/tree/master/sorting"
click node_searching "https://github.com/thealgorithms/c/tree/master/searching"
click node_conversions "https://github.com/thealgorithms/c/tree/master/conversions"
click node_dynamic_programming "https://github.com/thealgorithms/c/tree/master/dynamic_programming"
click node_leetcode "https://github.com/thealgorithms/c/tree/master/leetcode/src"
click node_data_structures "https://github.com/thealgorithms/c/tree/master/data_structures"
click node_dynamic_array "https://github.com/thealgorithms/c/blob/master/data_structures/dynamic_array/dynamic_array.h"
click node_hash_set "https://github.com/thealgorithms/c/blob/master/data_structures/hash_set/hash_set.h"
click node_list "https://github.com/thealgorithms/c/blob/master/data_structures/list/list.h"
click node_linked_stack "https://github.com/thealgorithms/c/blob/master/data_structures/stack/stack_linked_list/stack.h"
click node_client_server "https://github.com/thealgorithms/c/tree/master/client_server"
click node_fork_compat "https://github.com/thealgorithms/c/blob/master/client_server/fork.h"
click node_bool_header "https://github.com/thealgorithms/c/blob/master/client_server/bool.h"
click node_audio "https://github.com/thealgorithms/c/tree/master/audio"
click node_cipher "https://github.com/thealgorithms/c/tree/master/cipher"
click node_hash "https://github.com/thealgorithms/c/tree/master/hash"
click node_machine_learning "https://github.com/thealgorithms/c/tree/master/machine_learning"
click node_games "https://github.com/thealgorithms/c/tree/master/games"
click node_geometry "https://github.com/thealgorithms/c/tree/master/geometry"
click node_vectors_3d "https://github.com/thealgorithms/c/blob/master/geometry/vectors_3d.c"
click node_numerical_methods "https://github.com/thealgorithms/c/tree/master/numerical_methods"
click node_qr_decompose "https://github.com/thealgorithms/c/blob/master/numerical_methods/qr_decompose.h"
click node_qr_eigenvalues "https://github.com/thealgorithms/c/blob/master/numerical_methods/qr_eigen_values.c"
click node_math "https://github.com/thealgorithms/c/tree/master/math"
click node_greedy "https://github.com/thealgorithms/c/tree/master/greedy_approach"
click node_misc "https://github.com/thealgorithms/c/tree/master/misc"
click node_exercism "https://github.com/thealgorithms/c/tree/master/exercism"
click node_project_euler "https://github.com/thealgorithms/c/tree/master/project_euler"
click node_scheduling "https://github.com/thealgorithms/c/tree/master/process_scheduling_algorithms"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_sorting,node_searching,node_conversions,node_dynamic_programming,node_leetcode,node_greedy,node_misc,node_exercism,node_project_euler toneBlue
class node_data_structures,node_dynamic_array,node_hash_set,node_list,node_linked_stack toneAmber
class node_audio,node_cipher,node_hash,node_machine_learning,node_games,node_scheduling toneMint
class node_client_server,node_fork_compat,node_bool_header toneRose
class node_geometry,node_vectors_3d,node_numerical_methods,node_qr_decompose,node_qr_eigenvalues,node_math toneIndigo
```

## Components

### Algorithm domains

- [Sorting](https://github.com/thealgorithms/c/tree/master/sorting): `sorting`
- [Searching](https://github.com/thealgorithms/c/tree/master/searching): `searching`
- [Conversions](https://github.com/thealgorithms/c/tree/master/conversions): `conversions`
- [Dynamic programming](https://github.com/thealgorithms/c/tree/master/dynamic_programming): `dynamic_programming`
- [LeetCode solutions](https://github.com/thealgorithms/c/tree/master/leetcode/src): `leetcode/src`
- [Greedy algorithms](https://github.com/thealgorithms/c/tree/master/greedy_approach): `greedy_approach`
- [Other algorithms](https://github.com/thealgorithms/c/tree/master/misc): `misc`
- [Exercism exercises](https://github.com/thealgorithms/c/tree/master/exercism): `exercism`
- [Project Euler](https://github.com/thealgorithms/c/tree/master/project_euler): `project_euler`

### Data structures

- [Data structures](https://github.com/thealgorithms/c/tree/master/data_structures): `data_structures`
- [Dynamic array](https://github.com/thealgorithms/c/blob/master/data_structures/dynamic_array/dynamic_array.h): `data_structures/dynamic_array/dynamic_array.h`
- [Hash set](https://github.com/thealgorithms/c/blob/master/data_structures/hash_set/hash_set.h): `data_structures/hash_set/hash_set.h`
- [List](https://github.com/thealgorithms/c/blob/master/data_structures/list/list.h): `data_structures/list/list.h`
- [Linked stack](https://github.com/thealgorithms/c/blob/master/data_structures/stack/stack_linked_list/stack.h): `data_structures/stack/stack_linked_list/stack.h`

### Applied computing

- [Audio](https://github.com/thealgorithms/c/tree/master/audio): `audio`
- [Ciphers](https://github.com/thealgorithms/c/tree/master/cipher): `cipher`
- [Hash algorithms](https://github.com/thealgorithms/c/tree/master/hash): `hash`
- [Machine learning](https://github.com/thealgorithms/c/tree/master/machine_learning): `machine_learning`
- [Games](https://github.com/thealgorithms/c/tree/master/games): `games`
- [Process scheduling](https://github.com/thealgorithms/c/tree/master/process_scheduling_algorithms): `process_scheduling_algorithms`

### Network examples

- [Client-server examples](https://github.com/thealgorithms/c/tree/master/client_server): `client_server`
- [Fork compatibility](https://github.com/thealgorithms/c/blob/master/client_server/fork.h): `client_server/fork.h`
- [Boolean header](https://github.com/thealgorithms/c/blob/master/client_server/bool.h): `client_server/bool.h`

### Math and geometry

- [Geometry](https://github.com/thealgorithms/c/tree/master/geometry): `geometry`
- [3D vectors](https://github.com/thealgorithms/c/blob/master/geometry/vectors_3d.c): `geometry/vectors_3d.c`
- [Numerical methods](https://github.com/thealgorithms/c/tree/master/numerical_methods): `numerical_methods`
- [QR decomposition](https://github.com/thealgorithms/c/blob/master/numerical_methods/qr_decompose.h): `numerical_methods/qr_decompose.h`
- [QR eigenvalues](https://github.com/thealgorithms/c/blob/master/numerical_methods/qr_eigen_values.c): `numerical_methods/qr_eigen_values.c`
- [Mathematics](https://github.com/thealgorithms/c/tree/master/math): `math`

## Connections

- Client-server examples → Fork compatibility: uses on Windows (evidence: `client_server/tcp_full_duplex_client.c`)
- 3D vectors → Geometry: uses types (evidence: `geometry/vectors_3d.c`)
- QR eigenvalues → QR decomposition: calls decomposition (evidence: `numerical_methods/qr_eigen_values.c`)
