伪代码排版包 clrscode3e——Introduction to Algorithms Third Edition

最新推荐文章于 2021-09-13 10:35:55 发布
最新推荐文章于 2021-09-13 10:35:55 发布
阅读量3.4k 收藏
点赞数
分类专栏： Introduction to Algorithms 3rd 文章标签： windows 数据库 平台 c
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/zhumeng1989/article/details/7958429
版权

官网上厚道的都把伪代码排版的 LaTeX2e 包 clrscode3e 给了出来。

为了享受专业完美带来的快感，你需要知道 LaTeX，对于Windows平台，官网建议用 proTeXt。proTeXt 包括了MiKTeX 和 TeXstudio。当然，你只需要下载 proTeXt ，安装时选择将两个软件都装好就行了。

  • clrscode3e 包安装：
    1. 根据自己的安装位置在 C:\Program Files\MiKTeX 2.9\tex\latex\ 文件夹下建立 clrscode3e 文件夹，将 clrscode3e.sty 拷贝进去。
    2. 运行 Start->All Programs->MiKTeX 2.9->Maintenance (Admin)->Settings (Admin)，点击 Refresh FNDB 更新数据库。
  • 伪代码排版：
    1. 运行 Start->All Programs->TeXstudio->TeXstudio，自己可以根据手册稍微熟悉熟悉环境。
    2. 主要参考 clrscode3e.pdf 手册，生成pdf查看效果。（这里给出我自己敲的 test.tex）。

结果：

zhumeng1989
关注
专栏目录
Introduction to Algorithms, Third Edition（算法导论原书英文第三版）
08-07
Introduction to Algorithms, Third Edition（算法导论）
算法面试leadcode【经典150道】
最新发布
weixin_63958646的博客
07-28 404
时间复杂度 O(log(n))空间复杂度 O(1)
Introduction to Algorithms- Third Edition 目录版（非扫描版）
03-19
算法导论 英文版， 目录全，不是扫描版！ 希望可以帮助大家学习算法
clrscode3e.zip
03-29
《算法导论》（"Introduction to Algorithms"，简称CLRS）是计算机科学领域经典的一本教材，它深入浅出地介绍了各种算法，并提供了详细的伪代码描述。`clrscode3e.zip`是一个压缩包，其中包含了一个LaTeX宏包，专门...
clrscode3e
03-22
clrscode3e宏包是专门为《算法导论（第三版）》的伪代码设计的，它提供了相应的环境和命令，使得用户能够在LaTeX文档中复制《算法导论》中的伪代码格式。 使用clrscode3e宏包，你可以轻松地定义算法，设定伪代码的...
Introduction_to_Econometrics，Update，3e
01-31
Introduction_to_Econometrics，Update，3e.pdf
[电子书][高清] 计算机物理模拟 An Introduction to Computer Simulation Methods 3e
02-09
Now in a third edition, this book teaches physical concepts using computer simulations. The text incorporates object-oriented programming techniques and encourages students to develop good programming...
Introduction to Algorithms Third Edition
09-03
本资源仅供学习之用，如有纠纷，请立即删除。 Before there were computers, there were algorithms. But now that there are computers, there are even more algorithms, and algorithms lie at the heart of computing. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figures—many with multiple parts—illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms. The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals. In this, the third edition, we have once again updated the entire book. The changes cover a broad spectrum, including new chapters, revised pseudocode, and a more active writing style.
Introduction to Algorithms, Third Edition
12-09
Introduction to Algorithms, Third Edition 作者: Thomas H.Cormen / Charles E.Leiserson / Ronald L.Rivest / Clifford Stein
Introduction to Algorithms(third edition)
01-02
Before there were computers, there were algorithms. But now that there are com- puters, there are even more algorithms, and algorithms lie at the heart of computing. This book provides a comprehensive introduction to the modern study of com- puter algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figures—many with multiple parts—illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms.
ESP32-C3入门教程——导读
热门推荐
小康师兄
09-13 5万+
一、环境篇 ESP32-C3入门教程 环境篇①——简单介绍与软硬件准备 ESP32-C3入门教程 环境篇②——Windows开发环境准备 ESP32-C3入门教程 环境篇③——VS Code IDE快速入门 二、基础篇 ESP32-C3入门教程 基础篇①——GPIO口控制 ESP32-C3入门教程 基础篇②——PWM控制 ESP32-C3入门教程 基础篇③——ADC输入 ESP32-C3入门教程 基础篇④——串口通信 ESP32-C3入门教程 基础篇⑤——SPI通信 ESP32-C3入门教程 基础篇⑥——I
算法导论 第三版 Introduction to Algorithms, Third Edition
12-19
Introduction to Algorithms, Third Edition [精装] ~ Thomas H. Cormen (作者), Charles E. Leiserson (作者), Ronald L. Rivest (作者), Clifford Stein (作者) 出版社: The MIT Press; 3 (2009年9月30日) 精装: 1312页 正文语种: 英语 ISBN: 0262033844 条形码: 9780262033848 产品尺寸及重量: 23.1 x 20.6 x 5.3 cm ; 2.2 Kg ASIN: 0262033844 Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.
写在前面的话——Introduction to Algorithms Third Edition
zhumeng1989的专栏
09-08 2923
我近期在读 Introduction to Algorithms, Third Edition，英文版。已经大致学习了一遍，现在计划更细致读第二遍并做笔记总结。这个系列笔记将会完整呈现我个人的所想所思，更重要的是我希望能够吸引更多的人进来讨论，共同成长。 如有错误，欢迎指出与讨论。 by Zhu Meng E-mail:zhumeng1989(at)gmail.com 源代码托管：GitH
STM32开源代码——MPU6050程序
06-01
#define ACCEL_YOUT_L 0x3E #define ACCEL_ZOUT_H 0x3F #define ACCEL_ZOUT_L 0x40 #define TEMP_OUT_H 0x41 #define TEMP_OUT_L 0x42 #define GYRO_XOUT_H 0x43 #define GYRO_XOUT_L 0x44 #define GYRO_YOUT_H 0x45...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值