# parthnakum/prac architecture

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

- Interactive diagram: https://gitdiagram.com/parthnakum/prac
- Repository: https://github.com/parthnakum/prac

## Overview

This is a small collection of independent C++ practice programs covering array algorithms, recursion, basic-math problems, and printed patterns. There is no shared application workflow: users run an individual exercise, provide input where needed, and see its result. The graph keeps exercises separate rather than implying a common dispatcher. The README gives no further product details; links are shown only where the provided excerpts demonstrate console interaction.

Main entry points: [`arrays/largest-element.cpp`](https://github.com/parthnakum/prac/blob/main/arrays/largest-element.cpp) (Largest element), [`arrays/linear-search.cpp`](https://github.com/parthnakum/prac/blob/main/arrays/linear-search.cpp) (Linear search), [`arrays/second-largest-element.cpp`](https://github.com/parthnakum/prac/blob/main/arrays/second-largest-element.cpp) (Second largest), [`basic-recursion/fibonacci.cpp`](https://github.com/parthnakum/prac/blob/main/basic-recursion/fibonacci.cpp) (Fibonacci)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Array exercises"]
  node_largest["Largest element"]
  node_linear["Linear search<br/>[linear-search.cpp]"]
  node_second["Second largest"]
end

subgraph group_recursion["Recursion exercises"]
  node_factorial["Factorial<br/>[factorial.cpp]"]
  node_fibonacci["Fibonacci<br/>[fibonacci.cpp]"]
  node_recpal["Palindrome<br/>[palindrome.cpp]"]
  node_prime["Prime check<br/>[prime.cpp]"]
  node_print1n["Print 1 to N<br/>[print-1-to-n.cpp]"]
  node_printn1["Print N to 1<br/>[print-n-to-1.cpp]"]
  node_printname["Print name<br/>[print-name.cpp]"]
  node_revstr["Reverse string"]
  node_revarray["Reverse array"]
  node_sorted["Sorted array<br/>[sorted-array.cpp]"]
  node_sumarray["Sum array"]
  node_sumdigits["Sum digits<br/>[sum-of-digits.cpp]"]
  node_sumfirst["Sum first N<br/>[sum-of-first-n.cpp]"]
end

subgraph group_maths["Basic maths"]
  node_armstrong["Armstrong number<br/>[armstrong.cpp]"]
  node_countdigits["Count digits"]
  node_mathpal["Number palindrome<br/>[palindrome.cpp]"]
  node_reverse["Reverse digits"]
end

subgraph group_patterns["Pattern printing"]
  node_patterns["Pattern examples<br/>[patterns.cpp]"]
end

node_user(("User"))

node_user -->|"enters input"| node_largest
node_user -->|"enters input"| node_linear
node_user -->|"enters input"| node_second
node_user -->|"enters input"| node_fibonacci
node_user -->|"enters input"| node_prime
node_user -->|"enters input"| node_revstr
node_user -->|"enters input"| node_sumdigits
node_user -->|"enters input"| node_armstrong
node_user -->|"enters input"| node_countdigits
node_user -->|"enters input"| node_mathpal
node_user -->|"enters input"| node_reverse

click node_largest "https://github.com/parthnakum/prac/blob/main/arrays/largest-element.cpp"
click node_linear "https://github.com/parthnakum/prac/blob/main/arrays/linear-search.cpp"
click node_second "https://github.com/parthnakum/prac/blob/main/arrays/second-largest-element.cpp"
click node_factorial "https://github.com/parthnakum/prac/blob/main/basic-recursion/factorial.cpp"
click node_fibonacci "https://github.com/parthnakum/prac/blob/main/basic-recursion/fibonacci.cpp"
click node_recpal "https://github.com/parthnakum/prac/blob/main/basic-recursion/palindrome.cpp"
click node_prime "https://github.com/parthnakum/prac/blob/main/basic-recursion/prime.cpp"
click node_print1n "https://github.com/parthnakum/prac/blob/main/basic-recursion/print-1-to-n.cpp"
click node_printn1 "https://github.com/parthnakum/prac/blob/main/basic-recursion/print-n-to-1.cpp"
click node_printname "https://github.com/parthnakum/prac/blob/main/basic-recursion/print-name.cpp"
click node_revstr "https://github.com/parthnakum/prac/blob/main/basic-recursion/reverse-a-string-i.cpp"
click node_revarray "https://github.com/parthnakum/prac/blob/main/basic-recursion/reverse-an-array-2.cpp"
click node_sorted "https://github.com/parthnakum/prac/blob/main/basic-recursion/sorted-array.cpp"
click node_sumarray "https://github.com/parthnakum/prac/blob/main/basic-recursion/sum-of-array-elements-ii.cpp"
click node_sumdigits "https://github.com/parthnakum/prac/blob/main/basic-recursion/sum-of-digits.cpp"
click node_sumfirst "https://github.com/parthnakum/prac/blob/main/basic-recursion/sum-of-first-n.cpp"
click node_armstrong "https://github.com/parthnakum/prac/blob/main/know-basic-maths/armstrong.cpp"
click node_countdigits "https://github.com/parthnakum/prac/blob/main/know-basic-maths/count-digits-in-a-number.cpp"
click node_mathpal "https://github.com/parthnakum/prac/blob/main/know-basic-maths/palindrome.cpp"
click node_reverse "https://github.com/parthnakum/prac/blob/main/know-basic-maths/reverse-digits-of-a-number.cpp"
click node_patterns "https://github.com/parthnakum/prac/blob/main/patterns/patterns.cpp"

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_largest,node_linear,node_second,node_user toneBlue
class node_factorial,node_fibonacci,node_recpal,node_prime,node_print1n,node_printn1,node_printname,node_revstr,node_revarray,node_sorted,node_sumarray,node_sumdigits,node_sumfirst toneAmber
class node_armstrong,node_countdigits,node_mathpal,node_reverse toneMint
class node_patterns toneRose
```

## Components

### Array exercises

- [Largest element](https://github.com/parthnakum/prac/blob/main/arrays/largest-element.cpp): `arrays/largest-element.cpp`
- [Linear search](https://github.com/parthnakum/prac/blob/main/arrays/linear-search.cpp): `arrays/linear-search.cpp`
- [Second largest](https://github.com/parthnakum/prac/blob/main/arrays/second-largest-element.cpp): `arrays/second-largest-element.cpp`

### Recursion exercises

- [Factorial](https://github.com/parthnakum/prac/blob/main/basic-recursion/factorial.cpp): `basic-recursion/factorial.cpp`
- [Fibonacci](https://github.com/parthnakum/prac/blob/main/basic-recursion/fibonacci.cpp): `basic-recursion/fibonacci.cpp`
- [Palindrome](https://github.com/parthnakum/prac/blob/main/basic-recursion/palindrome.cpp): `basic-recursion/palindrome.cpp`
- [Prime check](https://github.com/parthnakum/prac/blob/main/basic-recursion/prime.cpp): `basic-recursion/prime.cpp`
- [Print 1 to N](https://github.com/parthnakum/prac/blob/main/basic-recursion/print-1-to-n.cpp): `basic-recursion/print-1-to-n.cpp`
- [Print N to 1](https://github.com/parthnakum/prac/blob/main/basic-recursion/print-n-to-1.cpp): `basic-recursion/print-n-to-1.cpp`
- [Print name](https://github.com/parthnakum/prac/blob/main/basic-recursion/print-name.cpp): `basic-recursion/print-name.cpp`
- [Reverse string](https://github.com/parthnakum/prac/blob/main/basic-recursion/reverse-a-string-i.cpp): `basic-recursion/reverse-a-string-i.cpp`
- [Reverse array](https://github.com/parthnakum/prac/blob/main/basic-recursion/reverse-an-array-2.cpp): `basic-recursion/reverse-an-array-2.cpp`
- [Sorted array](https://github.com/parthnakum/prac/blob/main/basic-recursion/sorted-array.cpp): `basic-recursion/sorted-array.cpp`
- [Sum array](https://github.com/parthnakum/prac/blob/main/basic-recursion/sum-of-array-elements-ii.cpp): `basic-recursion/sum-of-array-elements-ii.cpp`
- [Sum digits](https://github.com/parthnakum/prac/blob/main/basic-recursion/sum-of-digits.cpp): `basic-recursion/sum-of-digits.cpp`
- [Sum first N](https://github.com/parthnakum/prac/blob/main/basic-recursion/sum-of-first-n.cpp): `basic-recursion/sum-of-first-n.cpp`

### Basic maths

- [Armstrong number](https://github.com/parthnakum/prac/blob/main/know-basic-maths/armstrong.cpp): `know-basic-maths/armstrong.cpp`
- [Count digits](https://github.com/parthnakum/prac/blob/main/know-basic-maths/count-digits-in-a-number.cpp): `know-basic-maths/count-digits-in-a-number.cpp`
- [Number palindrome](https://github.com/parthnakum/prac/blob/main/know-basic-maths/palindrome.cpp): `know-basic-maths/palindrome.cpp`
- [Reverse digits](https://github.com/parthnakum/prac/blob/main/know-basic-maths/reverse-digits-of-a-number.cpp): `know-basic-maths/reverse-digits-of-a-number.cpp`

### Pattern printing

- [Pattern examples](https://github.com/parthnakum/prac/blob/main/patterns/patterns.cpp): `patterns/patterns.cpp`

### Other components

- **User**

## Connections

- User → Largest element: enters input (evidence: `arrays/largest-element.cpp`)
- User → Linear search: enters input (evidence: `arrays/linear-search.cpp`)
- User → Second largest: enters input (evidence: `arrays/second-largest-element.cpp`)
- User → Fibonacci: enters input (evidence: `basic-recursion/fibonacci.cpp`)
- User → Prime check: enters input (evidence: `basic-recursion/prime.cpp`)
- User → Reverse string: enters input (evidence: `basic-recursion/reverse-a-string-i.cpp`)
- User → Sum digits: enters input (evidence: `basic-recursion/sum-of-digits.cpp`)
- User → Armstrong number: enters input (evidence: `know-basic-maths/armstrong.cpp`)
- User → Count digits: enters input (evidence: `know-basic-maths/count-digits-in-a-number.cpp`)
- User → Number palindrome: enters input (evidence: `know-basic-maths/palindrome.cpp`)
- User → Reverse digits: enters input (evidence: `know-basic-maths/reverse-digits-of-a-number.cpp`)
