Exhaustive Cipher/In many cases we need to exhaustive combinations of algorithms...

中缀表达式到逆波兰式转换的程序代码,学习数据结构的可以-Infix expression to Reverse Polish conversion of program code, learning data structures can be

Data Replication Prototype Using ADO

VC++ ACCESS简单的数据库系统 ODBC-VC++ ACCESS simple ODBC database system

严蔚敏数据结构这本书对于大家来说都是必不可少的一本书，其中的经典算法更是被我们好多人细细研读。这么源代码会帮助我们更好地学习这些算法。

delphi 环境下邮件管理程序。-mail management procedures.

二叉树的基本操作-binary tree as the basic operation

Matlab提高篇介绍了Matlab的语言的一些基本格式。同时提供了丰富的实例，让读者整整体会该语言。-Matlab increase of the Matlab language, the basic format. While providing a wealth of examples to enable readers to a full understanding of the language.

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co

数据结构的上课课件，学习数据结构比不可少的课件-Data structure class courseware

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2