C 语言中“穷举”和“递推”算法的基本思想分析

王斌

电脑与电信 ›› 2016, Vol. 1 ›› Issue (5) : 49-50.

电脑与电信 ›› 2016, Vol. 1 ›› Issue (5) : 49-50.
算法研究

C 语言中“穷举”和“递推”算法的基本思想分析

  • 王斌
作者信息 +

Analysis on the Basic Ideas of "Exhaustion" and "Recursion" Algorithms of C Language

  • Wang Bin
Author information +
文章历史 +

摘要

结合实际案例分析C 语言中“穷举”和“递推”算法的基本思想,并对这两种算法的实现方法加以分析和研究, 通过C 语言将其转换成可操作执行的程序编码。文中对“穷举”测试标准的转换技巧和测试范围的控制方式进行了详细的分 析;对“递推”算法从初值、法则和递推次数三方面展开论述,同时对递推的顺序进行阐述。

Abstract

This paper analyzes the basic ideas of "exhaustion" and "recursion" algorithms of C language with actual cases, and analyzes the implementation methods of these two algorithms, converting it into executable code with C language. The conversion skills of "exhaustion" testing standards and controlling ways of test range are analyzed. The "recursion" algorithm is analyzed from the initial value, rule, and recursion times, and the recursion sequence is expounded at the same time.

关键词

C 语言 / 穷举算法 / 递推算法

Key words

C language / exhaustion algorithm / recursion algorithm

引用本文

导出引用
王斌. C 语言中“穷举”和“递推”算法的基本思想分析[J]. 电脑与电信. 2016, 1(5): 49-50
Wang Bin. Analysis on the Basic Ideas of "Exhaustion" and "Recursion" Algorithms of C Language[J]. Computer & Telecommunication. 2016, 1(5): 49-50
中图分类号: TP312.1   

Accesses

Citation

Detail

段落导航
相关文章

/