排列组合的并行实现
学生： 指导教师：郑晓薇 张哲
计算机与信息技术学院 计算机科学与技术专业 09 级
摘要：回溯法是一种试探求解的方法：通过对问题的归纳分析，找出求解问题的一个线
索，沿着这一线索往前试探，若试探成功，即得到解；若试探失败，就逐步往回退，换
其他路线再往前试探。排列组合是通过一定的约束条件，以及一定的规律来输出数字的
几组排列。排列组合是组合学最基本的概念。所谓排列，就是指从给定个数的元素中取
出指定个数的元素进行排序。组合则是指从给定个数的元素中仅仅取出指定个数的元素，
不考虑排序。排列组合的中心问题是研究给定要求的排列和组合可能出现的情况总数。
关键词：回溯法，排列组合，约束条件
Abstract ： Back in the law is a test the solution method: through inductive analysis of
problem, find out the problem solving a clue, along the clues on test, test if successful, namely
get solution; If the test failure, he gradually back towards the back, change other routes go a
test. The permutation and combination is through certain constraints, and certain laws to output
digital several groups of alignment. The permutation and combination is the combination of
the most basic learning concept. The so-called arrangement, is refers to the number of
elements from a given out the elements of the designated number order. Combination means
that a given number of elements from the specified number of elements out only, do not
consider sort. To arrange a combination of center problems are given the arrangement and
study demand combined the possibility of total.
Key words：backtracking method; permutation and combination; constraint condition
第 2 页
评论0
最新资源