-
lesson1-2
棋盘覆盖，算法分析，很有用的东西，大家一起来分享一下(Board covers, algorithm analysis, useful things, we share together)
- 2011-01-06 15:15:11下载
- 积分：1
-
graph-DFS
邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
- 2013-10-27 20:16:41下载
- 积分：1
-
sy1.cpp
实验内容：
建立一个包含图书（书号，书名，定价）信息的的链表，并具有如下功能：
(1) 根据指定图书个数，逐个输入图书信息；
(2) 根据书名进行查找，返回此书的书号和定价；
(3) 根据指定的位置可返回相应的图书信息（书号，书名，定价）；
(4) 给定一个图书信息，插入到表中指定的位置；
(5) 删除指定位置的图书记录；
(6) 统计表中图书个数。
(It is a good c++.)
- 2012-10-26 15:23:15下载
- 积分：1
-
function
提供字符串方法，大家面试可以用，包括找出对称字串(Some string function)
- 2011-05-14 23:14:49下载
- 积分：1
-
car
停车场管理系统 c语言实现
停车场拥有M个车位和一条进入停车场的便道，便道上最多停放N辆汽车。汽车要想进入车位，首先进入便道等候。若有空闲车位，则停车入位，否则在便道继续等候，直至有车位空出。若便道已经停满等候的汽车，后到达的汽车只能离开，选择其他停车场。设计一个停车场管理系统，模拟停车场的运作，并统计停车场的收入。(Parking Management System with M c language parking spaces and a sidewalk into the parking lot, parked up on the sidewalk N cars. To enter the car parking spaces, first into the pavement waiting. If free parking, the parking into place, or in the sidewalk to wait until the needed spot. If the sidewalk is already full of parked cars waiting, after the arrival of the vehicle to leave, choose a parking lot. Designing a car park management systems, simulation parking operations and parking revenue statistics.)
- 2011-08-21 21:55:11下载
- 积分：1
-
josephus
通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)
- 2017-11-12 10:30:06下载
- 积分：1
-
xuanzexingjiegou
选择型结构c语言编程 (Choose the type of structure of C language programming)
- 2013-09-24 22:11:37下载
- 积分：1
-
maopao_youhua
冒泡优化：
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。
思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分：1
-
hellow4
序列二次规划算法，能求解包含约束和无约束的问题，非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)
- 2021-01-08 18:18:51下载
- 积分：1
-
work_std
工作时单元功能实现的部分资料
主要涉及字符串处理、排序算法，字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
- 2007-01-23 08:57:38下载
- 积分：1
