C++ 関数ポインターの原理を分析してコードの再利用機能を強化します。

typedef int (*function_ptr)(int);

double calculate_discount(double price, double discount_percentage) {
  return price * (1 - discount_percentage);
}

double apply_discount(double price, function_ptr discount_function) {
  return discount_function(price);
}

double flat_discount_function(double price) {
  // 计算固定折扣
}

double percentage_discount_function(double price) {
  // 计算百分比折扣
}

#include <iostream>
#include <vector>

using namespace std;

// 学生类
class Student {
public:
  string name;
  int score;
};

// 排序策略函数指针类型
typedef bool (*sort_strategy_ptr)(const Student&, const Student&);

// 排序策略：按名称升序
bool sort_by_name_ascending(const Student& a, const Student& b) {
  return a.name < b.name;
}

// 排序策略：按分数降序
bool sort_by_score_descending(const Student& a, const Student& b) {
  return a.score > b.score;
}

// 根据排序策略函数指针对学生列表进行排序
void sort_students(vector<Student>& students, sort_strategy_ptr sort_strategy) {
  sort(students.begin(), students.end(), sort_strategy);
}

int main() {
  // 初始化学生列表
  vector<Student> students = {
    {"John", 85},
    {"Jane", 90},
    {"Peter", 75},
    {"Mary", 80}
  };

  // 按名称升序排序
  sort_students(students, sort_by_name_ascending);

  // 输出按名称排序后的列表
  for (const Student& student : students) {
    cout << student.name << " " << student.score << endl;
  }

  // 按分数降序排序
  sort_students(students, sort_by_score_descending);

  // 输出按分数排序后的列表
  for (const Student& student : students) {
    cout << student.name << " " << student.score << endl;
  }

  return 0;
}