资源列表
asd
- 单纯性法解线性规划问题的一段代码，谢谢老邢支持快接啊是否能-bool Is_objectLine_All_Positive()
selectSort.cpp.tar
- 这是一个直接选择排序的算法源程序，算法被单独写成一个函数，希望对大家有用-This is a direct source selection sort algorithm, the algorithm is written as a separate function, we hope to be useful
john
- 约瑟夫环文题描述：已知n个人围坐圆桌周围。从编号k的人开始报数，数到m的那个人出列；他的下一个人有1开始报数，数到m的那个人呢出列，一次规律重复下去-Joseph ring title descr iption: n known individuals sitting around the table.People began to count off number k, count to m out the man He has 1 started to count off the next
MaxSubSum
- 用三种方法解决最大子序列和问题，分别是基本方法，分治算法和动态规划算法，算法复杂度不断提高-Three methods were used to solve sequence and the biggest problem, respectively is the basic method and divide and conquer algorithm and dynamic programming algorithm, the complexity of the algorithm is i
shell
- 数据结构中内部排序中的希尔排序 完整源代码实现-Sort the data in the internal structure of the complete source code sorting Hill
function
- 提供字符串方法，大家面试可以用，包括找出对称字串-Some string function
Binary-Tree-Sort
- 二叉树排序，二叉树的递归调用排序，属于C语言源码-Binary Tree Sort
polynomials
- 两个多项式相加，使用链表，计算时间复杂度，数据结构应用-Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation. If the polynomials have M and N terms, respectively, what is the time complexity of your program?
ee
- 用C++环境建立一个链表，输入及输出内容-In C++ environment to create a linked list, the input and output
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
Sequence
- 这是一个顺序表的建立和数据插入的小程序，其中还涉及到对结构体的排序-This is an order of table creation and data into the program, which also involves the sort of structure
ReplaceText
- 在文件中实现字符串的替换功能。需要输入四个参数。源文件名，目标文件名，需要替换的子字符串，新的字符串。-String replace function in the file. Need to enter the four parameters. The source file name, the target file name, you need to replace the substring, the new string.