排列组合的实现

最新推荐文章于 2025-07-18 12:14:54 发布

原创最新推荐文章于 2025-07-18 12:14:54 发布 · 2k 阅读

本内容遵循CC 4.0 BY-SA版权协议

标签

#border #function #float #class

本文介绍了一种使用 C++ 实现的排列和组合算法。通过定义特定的类和函数，能够生成给定元素集的所有可能排列及不同大小的子集组合，并展示了如何利用递归和位操作来高效地解决问题。

排列：

Demo

typedef void (*PrintFunc)(const ELEMENT* elements, const size_t size);

    perm(size_t size, PrintFunc func_print):m_size(size), m_func_print(func_print) {}

    void operator()(ELEMENT* elements, size_t start, size_t end);

    void swap(ELEMENT& lhs, ELEMENT& rhs)

void perm::operator()(ELEMENT* elements, size_t start, size_t end)

        m_func_print(elements, m_size);

        for(size_t i = start; i != end; ++i)

            swap(elements[i], elements[start]);

            operator()(elements, start + 1, end);

            swap(elements[i], elements[start]);

void print(const ELEMENT* elements, const size_t size)

        std::cout << elements[i] << '/t';

    ELEMENT array[] = {"d", "da", "af", "5", "8"};

    dskit::perm(sizeof(array) / sizeof(ELEMENT), print)(array, 0, sizeof(array) / sizeof(ELEMENT));

组合：

Demo

void combination(std::ostream& out, const ELEMENTTYPE* src, size_t n_set);

void combination_sorted(std::ostream& out, const ELEMENTTYPE* src, size_t n_set, size_t n_subset, size_t start_pos = 0);

void combination_sorted(std::ostream& out, const ELEMENTTYPE* src, size_t n_set);

Demo

void combination(std::ostream& out, const ELEMENTTYPE* src, size_t n_set)

    for(size_t i = 0; i < (1 << n_set); ++i)

        for(size_t j = 0; j < n_set; ++j)

void combination_sorted(std::ostream& out, const ELEMENTTYPE* src, size_t n_set, size_t n_subset, size_t start_pos)

        for(size_t index = 0; index < dep; ++index)

        for(size_t i = start_pos; i <= n_set - n_subset; ++i)

            combination_sorted(out, src, n_set, n_subset - 1, i + 1);

void combination_sorted(std::ostream& out, const ELEMENTTYPE* src, size_t n_set)

    for(size_t i = 0; i != n_set + 1; ++i)

        combination_sorted(out, src, n_set, i, 0);