Hello, World! 🦖

/*

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.

Makefile

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

Requirements:

    Compiler: g++ or clang++

Build/Run/Clean:

To build, run, or clean projects using this Makefile, execute the following commands:

make

make run

make clean

*/

Programming I

• Documents

#	Project
1	HelloWorld
2	Recipe
3	Ingredients
4	Grade Calculator
5	Shipping Cost
6	Morra Game
7	Morra-Series Game
8	Order Pizza
9	Circle
10	Grade Calculator-Functions
11	Echo List
12	Delete Repeats

Programming II

• Documents

#	Project
1	Two Dimensional Array
2	Linear-Search & Bubble-Sort
3	Binary-Search/Selection-Sort & Introduction to Pointers
4	Pointers
5	Dynamic Memory Allocation
6	C-Strings & Strings
7	Structures
8	File Streams: Input/Output/Append (manual-update)
9	File Streams: Input/Output (auto-update)
10	File Streams (binary conversion): Input/Output/Binary (auto-update)
11	Classes & Header Files

Data Structures I

• Documents

#	Project
1	Default Arguments
2	Function Overloading & Templates
3	Class Template Header & Driver Files
4	Array List
5	Array List (Continued)
6	Linked List
7	Stack
8	Queue
9	Reverse Polish Notation Evaluator: Stack
10	Palindrome Evaluator: Stack
11	Palindrome Evaluator: Stack & Queue
12	Operator Overloading & Doubly Linked List
13	Operator Overloading & Doubly Linked List (Continued)

Data Structures II

• Documents

#	Project
1	Recursion
2	Linked List Recursion
3	Array List Binary Search Recursion
4	Quadratic Probing Hash Table
5	Array List Binary Search Recursion (Continued)
6	Binary Search Tree
7	Max-Heap Priority Queue
8	AVL (Self-Balancing Binary Search Tree)
9	Huffman Tree: Encoding/Decoding/Compression
10	Array List Sorting Algorithms: Quick-Sort & Selection-Sort
11	Array List Sorting Algorithms (Continued): Heap-Sort
12	Graph Algorithms: Dijkstra's Shortest Path, Depth-First Search, & Breadth-First Search