摘要
传统的分治法只能解决个选手的循环赛赛程排列问题,但对于非个选手的赛程排列问题并不能很好地解决,提出了一种能够完成非个选手赛程安排的新算法行向变换排列法,并通过C语言编程对其进行了分析与验证.
Traditional Divide-and-Conquer algorithm can only solve the round robin arrangement of 2~n players . But it can not solve the problem of not 2~n players quite well . This thesis proposes horizontal variance arrangement algorithm to solve the problem of not 2~n players , furthermores analyzes and proves it by C language.
出处
《辽宁大学学报（自然科学版）》
CAS
2005年第1期63-65,共3页
Journal of Liaoning University：Natural Sciences Edition
基金
辽宁省教育厅科研基金(20081228)
关键词
行向变换排列法
循环赛
日程表
分治法
horizontal variance arrangement algorithm
the round robin
schedule
Divide-and-Conquer algorithm.
