登录
首页 » Visual C++ » hellow4

hellow4

于 2021-01-08 发布 文件大小:5KB
0 354
下载积分: 1 下载次数: 49

代码说明:

  序列二次规划算法,能求解包含约束和无约束的问题,非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)

文件列表:

hellow4.cpp,20035,2009-02-24

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • test12
    约瑟夫问题,用数据结构的循环链表实现约瑟夫问题的解答(Joseph problems,30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain )
    2012-05-14 10:29:52下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • strcon
    对于给定的n个字符串,请找出一种最佳的连接方式,使得采用该连接方式得到的字符串在所有连接的结果中,字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)
    2011-09-02 16:52:40下载
    积分:1
  • Haffman
    将一组数组转换为哈夫曼编码,使用数据结构中的二叉树功能实现(Convert an array to Haffman code)
    2016-01-30 14:56:20下载
    积分:1
  • xianduan
    输入俩条线段的首尾坐标,用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)
    2011-05-22 22:47:16下载
    积分:1
  • tanxinfangfa
    说明:  贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
    2006-05-15 21:50:01下载
    积分:1
  • joseph
    用链表解决约瑟夫问题。 约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。 其中包括一个实验报告,介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
    2012-08-27 22:37:52下载
    积分: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
  • structure-array-code
    根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)
    2013-10-09 14:35:43下载
    积分:1
  • yu992324
    总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)
    2010-07-29 09:41:07下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载