OOP Lab 11: Dynamic Order System (Dynamic Aggregation)

Simulate an Order Placement System where a Customer manages dynamically allocated Orders:

• ◦
  Attributes: orderID (int), productName (std::string), quantity (int), price (double).
• ◦
  Methods: displayOrderDetails() const, getTotalPrice() const returning quantity * price.

• ◦
  Attributes: customerID (int), customerName (std::string), Order* orders (dynamic heap array), int orderCount, int capacity.
• ◦
  Constructor allocating initial heap capacity and setting orderCount = 0.
• ◦
  Destructor ~Customer() deallocating dynamic memory with delete[] orders.
• ◦
  Method addOrder(const Order& order) with capacity expansion.
• ◦
  Method displayOrders() const printing order details and grand total expenditure.

• ◦
  void linkOrderToCustomer(Customer* cust, const Order& order) calling cust->addOrder(order).

• ◦
  Create a Customer and multiple Order objects.
• ◦
  Associate orders using linkOrderToCustomer() and display billing summary.