# **📦 Booth: C++ (1983)** * **Creator:** Bjarne Stroustrup (Bell Labs) * **Design Philosophy:** "C with Classes" — bring high-level object abstractions and type-safe encapsulation to systems-level code, adhering strictly to the *zero-overhead principle*: "What you don't use, you don't pay for." * **Key Innovations:** Classes, dynamic polymorphism (virtual functions), Resource Acquisition Is Initialization (RAII), function and operator overloading, templates (generic programming), and reference types. ## **🚀 Hello, World\!** \#include \ int main() { std::cout \<\< "Hello, World\!" \<\< std::endl; return 0; } ## **🎨 Showpiece: Generic RAII Stack Vector** This script showcases classic C++ techniques: static encapsulation, templates for generic type safety, and automatic resource cleanup via destructors (RAII). Mathematically, dynamic sizing of sequential structures follows an amortized complexity: ![][image1]\#include \ \#include \ template \ class SimpleVector { private: T\* data; size\_t capacity; size\_t length; void resize() { capacity \= (capacity \== 0\) ? 1 : capacity \* 2; T\* new\_data \= new T\[capacity\]; for (size\_t i \= 0; i \< length; \++i) { new\_data\[i\] \= data\[i\]; } delete\[\] data; data \= new\_data; } public: // Constructor SimpleVector() : data(nullptr), capacity(0), length(0) {} // Destructor (RAII guarantees automatic cleanup) \~SimpleVector() { delete\[\] data; std::cout \<\< "\[RAII\] Dynamic memory freed." \<\< std::endl; } void push(const T& value) { if (length \== capacity) { resize(); } data\[length++\] \= value; } T get(size\_t index) const { if (index \>= length) { throw std::out\_of\_range("Index out of bounds"); } return data\[index\]; } size\_t size() const { return length; } }; int main() { { SimpleVector\ numbers; numbers.push(10); numbers.push(20); numbers.push(30); std::cout \<\< "Vector Size: " \<\< numbers.size() \<\< std::endl; std::cout \<\< "Element at Index 1: " \<\< numbers.get(1) \<\< std::endl; } // Scope ends here \- Vector destructor is automatically invoked\! return 0; } [image1]: