这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.
最短路径 迪杰斯特拉 最短路径 迪杰斯特拉-Shortest Path Floyd Shortest Path Floyd
数据结构 详细描述了如何创建二分查找的方法以及操作-Data structure described in detail how to create a binary search method and the operation of
某正在运行的大型医院源程序，PB+SQLSERVER设计，对程序开发和设计非常有参考和借鉴作用，赶快下栽吧-are running a large hospital source, PB SQLSERVER design, procedures for the development and design of information and very useful, it quickly crashed
网友 lc_mtt (网名：柠檬) 提供的一个比较完善的超市销售管理系统（后台)，漂亮的Office XP界面，功能基本完善，基于MS SQL Server 2000后台数据库开发，作者自主独立开发，对于想学习SQL Server数据库开发的网友是一个很不错的范例。有关具体信息请参见压缩包里的运行说明书。-Netizen lc_mtt (Network Name : Lemon) to provide a more complete Supermarket sales management system (background) pretty Office XP interface, improved basic functions, Based on the MS SQL Server 2000 database development background, the authors developed independently, For want to learn SQL Server database development in the discussion is a very good example. The specific information please refer to a bundle of the compression operation manuals.
这是一个关于最长单调递增子序列的代码能运行-This is a monotonically increasing for the longest sequences of code to run
它的人力资源管理系统 ！这是任何一家公司涵盖人力资源系统开发的数据库项目。它保持雇员的详情、 雇员的义务责任和公司的薪酬管理。
用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it
约瑟夫环问题，设计一个程序求出出列顺序 基于VISUAL C++开发-Joseph Ring problem, design a procedure to derive the column order based on VISUAL C++ Development
用JAVA开发的数据库底层核心，是学习用JAVA开发数据库系统的必要资料。-with JAVA development of the database underlying core, Java is used to study the development of a database system the necessary information.
微软msde，数据库引擎得简单查许分析器-Microsoft MSDE database engines were simple check Xu Analyzer
一个曲线类，可用于Dialog，也可用于View-a curve type can be used Dialog also can be used to View
旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.
该程序完成对二叉树的非递归中序遍历，因为其中涉及到二叉树的构造，而且使用类来构造，所以代码比较多。-completion of the process of non- recursive binary tree which preorder because it involved the construction of a binary tree, but the use of class structure, the code more.
1800道数据结构题和答案-1800 data structure and that the answer
包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等-includes various tests, such as search and algorithm code, such as Bubble algorithm, the tree traversal, linked list, queue, stack, etc.
本站资源：696524 个
本站会员：103848 个
总计下载：487690 次
今日上传：0 个
Copyright© 2019-2024 |
Powered by Imdn
|
浙ICP备16007336号
|
|
联系客服（QQ：3324461878）
本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！
