| 单词排版的两种算法 |
| |
| 引用本文： | 王厚峰.单词排版的两种算法[J].计算机研究与发展,1994,31(6):14-18. |
| |
| 作者姓名： | 王厚峰 |
| |
| 作者单位： | 华中师范大学计算机系 |
| |
| 摘 要： | 在对英文排版时，我们既应考虑单词之间的间隔，以便清晰可读，又应考虑节省版面，以便降低费用，本文通过详细地讨论两种算法可以解决这一矛盾。
|
| 关 键 词： | 排版 动态规划法 算法 单词排版 |
Two Algorithms for Words Typesetting |
| |
| Wang Houfeng.Two Algorithms for Words Typesetting[J].Journal of Computer Research and Development,1994,31(6):14-18. |
| |
| Authors: | Wang Houfeng |
| |
| Abstract: | When we typeset words, we should consider not only to reserve space between two words in order to make them intelligible and readable, but also to save layout site in older to reduce the cost of paper. In this paper. we discuss in detail two methods to solve the problem. |
| |
| Keywords: | Typesetting greedy method dynamic programming method time complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
