-
strap_down_inertial_navigation
说明: 捷联系统C语言实现算法,已经过实验验证。(SINS C language algorithm, has been verified by tests.)
- 2008-11-20 16:50:37下载
- 积分:1
-
migong
输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
- 2016-05-14 20:16:00下载
- 积分:1
-
expression
利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。
输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。
(Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
- 2011-10-30 14:14:01下载
- 积分:1
-
fml
已知二叉树的先序遍历结果,建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
- 2015-02-15 15:20:26下载
- 积分:1
-
qiuhe
多项式求和,用链表实现的一元多项式求和程序,比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)
- 2011-09-15 09:16:38下载
- 积分:1
-
yuesefu
数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)
- 2012-12-02 16:23:02下载
- 积分:1
-
POJ2371
PKU ONLINEJUDGE 2371
- 2011-10-21 15:03:03下载
- 积分:1
-
Mult
说明: 数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)
- 2011-03-20 20:28:31下载
- 积分:1
-
mifeng
c语言平时作业练习,包括输入输出,数组,链表等
c语言平时作业练习,包括输入输出,数组,链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)
- 2014-04-28 16:01:53下载
- 积分:1
-
tu
说明: 、实验目的
1 熟练掌握各种内排序方法,深刻理解排序算法及其执行过程;
2 学会分析各种内排序算法的性能;
3 了解各种排序方法的优缺点,对于实际问题能够选择一种较好的排序方案;
4 熟练掌握图的存储结构;
5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。
6 了解图的最小生成树算法。
(Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)
- 2009-12-30 21:15:29下载
- 积分:1