// Interface for financial calculations
class IFinancialCalculator {
public:
virtual double calculateInterest(double principal, double rate, int time) = 0;
virtual double calculateLoanEMI(double principal, double rate, int term) = 0;
virtual ~IFinancialCalculator() {}
};
// Implementation of the financial calculator
class FinancialCalculator : public IFinancialCalculator {
public:
double calculateInterest(double principal, double rate, int time) override {
return principal * rate * time / 100;
}
double calculateLoanEMI(double principal, double rate, int term) override {
double monthlyRate = rate / (12 * 100);
return (principal * monthlyRate * pow(1 + monthlyRate, term)) / (pow(1 + monthlyRate, term) - 1);
}
};
// Usage of the interface and implementation
int main() {
IFinancialCalculator* calculator = new FinancialCalculator();
double interest = calculator->calculateInterest(1000, 5, 2);
double emi = calculator->calculateLoanEMI(50000, 10, 60);
delete calculator;
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?