# cpp-projects

**Repository Path**: codes_test/cpp-projects

## Basic Information

- **Project Name**: cpp-projects
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: main
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2025-07-01
- **Last Updated**: 2025-07-01

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

[![Codacy Badge](https://app.codacy.com/project/badge/Grade/b2686d21dc134cd2ae07194660b2f0b0)](https://app.codacy.com/gh/nragland37/cpp-projects/dashboard?utm_source=gh&utm_medium=referral&utm_content=&utm_campaign=Badge_grade)
[![License](https://img.shields.io/badge/license-MIT-blue)](https://github.com/nragland37/cpp-projects/blob/main/LICENSE)

# <p align="center"> Hello, World! 🦖 </p>

/*

This is a comprehensive collection of C++ projects, covering a wide range of topics from the basic `Hello World` to advanced `Self-Balancing AVL Trees`, and everything in between.

<br>

## Makefile (Optional)
For projects that manage multiple source files (`Data Structures II`), a custom Makefile is included.

### Requirements:
- **Compiler**: g++ or clang++ (`macOS typically includes clang++`)
- **Windows users**: Install [WSL](https://learn.microsoft.com/en-us/windows/wsl/install) for access to both compilers, or [MinGW](https://www.mingw-w64.org/) for g++

### Build/Run/Clean:
To build, run, or clean projects using this Makefile, execute the following commands:

```bash
make
```
```bash
make run
```
```bash
make clean
```

*/


### [Programming I](/programming-I)
* [Documents](programming-I/docs/)

| # | Project |
|:---:|:---|
| 1 | [HelloWorld](./programming-I/01-helloworld) | 
| 2 | [Recipe](./programming-I/02-recipe) | 
| 3 | [Ingredients](./programming-I/03-ingredients) | 
| 4 | [Grade Calculator](./programming-I/04-gradeCalc) |  
| 5 | [Shipping Cost](./programming-I/05-shippingCost) |  
| 6 | [Morra Game](./programming-I/06-morra) |
| 7 | [Morra-Series Game](./programming-I/07-morraSeries) |
| 8 | [Order Pizza](./programming-I/08-pizza) | 
| 9 | [Circle](./programming-I/09-circleArea) |
| 10 | [Grade Calculator-Functions](./programming-I/10-gradeCalc2) |
| 11 | [Echo List](./programming-I/11-echoList) |
| 12 | [Delete Repeats](./programming-I/12-deleteRepeats) |

<br>

### [Programming II](/programming-II)
* [Documents](programming-II/docs/)

| # | Project |
|:---:|:---|
| 1 | [Two Dimensional Array](./programming-II/01-twoDimensionalArray) |
| 2 | [Linear-Search & Bubble-Sort](./programming-II/02-linearSearch-BubbleSort) |
| 3 | [Binary-Search/Selection-Sort & Introduction to Pointers](./programming-II/03-binarySearch-selectionSort_introToPointers) |
| 4 | [Pointers](./programming-II/04-pointers) |
| 5 | [Dynamic Memory Allocation](./programming-II/05-dynamicMemoryAllocation) |
| 6 | [C-Strings & Strings](./programming-II/06-cString-string) |
| 7 | [Structures](./programming-II/07-structures) |
| 8 | [File Streams: Input/Output/Append (manual-update)](./programming-II/08-fstream-manualUpdate) |
| 9 | [File Streams: Input/Output (auto-update)](./programming-II/09-fstream-autoUpdate) |
| 10 | [File Streams (binary conversion): Input/Output/Binary (auto-update)](./programming-II/10-fstream-autoUpdate-binaryConversion) |
| 11 | [Classes & Header Files](./programming-II/11-classes-headerFiles) |

<br>

### [Data Structures I](/data_structures-I)
* [Documents](data_structures-I/docs/)

| # | Project |
|:---:|:---|
| 1 | [Default Arguments](./data_structures-I/01-defaultArgs) |
| 2 | [Function Overloading & Templates](./data_structures-I/02-max) |
| 3 | [Class Template Header & Driver Files](./data_structures-I/03-dyad) |
| 4 | [Array List](./data_structures-I/04-AList) |
| 5 | [Array List (Continued)](./data_structures-I/05-AList) |
| 6 | [Linked List](./data_structures-I/06-LList) |
| 7 | [Stack](./data_structures-I/07-Stack) |
| 8 | [Queue](./data_structures-I/08-Queue) |
| 9 | [Reverse Polish Notation Evaluator: Stack](./data_structures-I/09-rpnStack) |
| 10 | [Palindrome Evaluator: Stack](./data_structures-I/10-palindromes) |
| 11 | [Palindrome Evaluator: Stack & Queue](./data_structures-I/11-pal2) |
| 12 | [Operator Overloading & Doubly Linked List](./data_structures-I/12-DLList) |
| 13 | [Operator Overloading & Doubly Linked List (Continued)](./data_structures-I/13-DLList) |

<br>

### [Data Structures II](/data_structures-II)
* [Documents](data_structures-II/docs/)

| # | Project |
|:---:|:---|
| 1 | [Recursion](./data_structures-II/01-Recursion-StockClass) |
| 2 | [Linked List Recursion](./data_structures-II/02-Reverse-LList-Recursion) |
| 3 | [Array List Binary Search Recursion](./data_structures-II/03-AList-BinarySearch-Recursion) |
| 4 | [Quadratic Probing Hash Table](./data_structures-II/04-Hashing-Quadratic-Probing) |
| 5 | [Array List Binary Search Recursion (Continued)](./data_structures-II/05-Updated-AList-BinarySearch-Recursion) |
| 6 | [Binary Search Tree](./data_structures-II/06-BST) |
| 7 | [Max-Heap Priority Queue ](./data_structures-II/07-Priority-Queue) |
| 8 | [AVL (Self-Balancing Binary Search Tree)](./data_structures-II/08-AVLTree) |
| 9 | [Huffman Tree: Encoding/Decoding/Compression](./data_structures-II/09-Huffman-Algorithm) |
| 10 | [Array List Sorting Algorithms: Quick-Sort & Selection-Sort](./data_structures-II/10-AList-Sorting-Algorithms) |
| 11 | [Array List Sorting Algorithms (Continued): Heap-Sort](./data_structures-II/11-Updated-AList-Sorting-Algorithms) |
| 12 | [Graph Algorithms: Dijkstra's Shortest Path, Depth-First Search, & Breadth-First Search](./data_structures-II/12-Graph-Traversal) |