摘要
在实际应用中经常需要生成一些满足某种条件的数值序列,产生序列往往用递归方法.本文首先介绍一种序列生成方法—后继序列法,说明了其实现步骤.比较而言,该法更简单有效,易于理解,有通用性.然后将这种方法用于解决具有典型意义的堆栈输出问题,得到了两种精巧的算法.
active applications need often to generate many numeric sequences satisfied with some requerments. Sometimes the sequences are produced using reeursion algorithms. This paper introduces the successor-sequences method, that is an simple,effeetive,gearal purpose and easy to understand algorithm to generate sequences,presents its prineipls and usage steps,and then take uses of the successor-sequences algorithms to resolve a typical problem,stack-output problem.
出处
《小型微型计算机系统》
CSCD
北大核心
2006年第12期2314-2316,共3页
Journal of Chinese Computer Systems
关键词
堆栈输出问题
后继序列法
穷举法
stack-output problem
successor-sequences algorithms
brute-force method