Search - c select

Search - c select - List

[Mathimatics-Numerical algorithms] database_edwardversion DL : 0: 1．简介本程序是用纯C语言编的一个基于菜单命令行的数据库系统。可以创建多个数据库，数据库表，字段。其中字段的类型只能为整形，浮点型，字符型和字符串型（最大长度确定，不能改变）。 2．功能 a)数据库存储：一个数据库存储于一个文件中，打开文件将数据库载入到内存。保存时将内存中数据重新写到文件中去。 b)数据库管理：提供数据库的创建，表的创建，字段的创建提供对数据的查询，删除，修改，排序功能 c)支持SQL部分语句：支持SELECT 和DELETE语句-1. Introduction of this program is pure C language based on a series of menu command-line database system. You can create multiple databases, database tables, fields. The type field which can only plastic, floating point, character and string (maximum length and can not be changed). 2. A function) database storage : a database stored in a document, the document will open the database to include memory. When will preserve memory data re-wrote a document. B) database management : to provide database creation, table creation, the field for the creation of data inquiries, delete, modify, sequencing feature c) some support SQL statement : support DELETE and SELECT statements
Date : 2008-10-13 Size : 12.53kb User : 李军
[Mathimatics-Numerical algorithms] database_edwardversion DL : 1: 1．简介本程序是用纯C语言编的一个基于菜单命令行的数据库系统。可以创建多个数据库，数据库表，字段。其中字段的类型只能为整形，浮点型，字符型和字符串型（最大长度确定，不能改变）。 2．功能 a)数据库存储：一个数据库存储于一个文件中，打开文件将数据库载入到内存。保存时将内存中数据重新写到文件中去。 b)数据库管理：提供数据库的创建，表的创建，字段的创建提供对数据的查询，删除，修改，排序功能 c)支持SQL部分语句：支持SELECT 和DELETE语句-1. Introduction of this program is pure C language based on a series of menu command-line database system. You can create multiple databases, database tables, fields. The type field which can only plastic, floating point, character and string (maximum length and can not be changed). 2. A function) database storage : a database stored in a document, the document will open the database to include memory. When will preserve memory data re-wrote a document. B) database management : to provide database creation, table creation, the field for the creation of data inquiries, delete, modify, sequencing feature c) some support SQL statement : support DELETE and SELECT statements
Date : 2025-12-23 Size : 12kb User : 李军
[Mathimatics-Numerical algorithms] ID3 DL : 0: ID3算法的几种实现方法 C++实现，pdf文档，需要选取出来。-ID3 algorithm several methods to achieve C++ to achieve, pdf documents, need to select from.
Date : 2025-12-23 Size : 52kb User : aulufylee
[Mathimatics-Numerical algorithms] AlgorithmCpp DL : 0: 主要在VC6.0上用MFC完成的排序算法和搜索算法：首先弹出一个对话框，上面有排序前和排序后的编辑框，在排序前编辑框中输入整型数组，然后选择排序的方法，点排序按钮即将排序好的数组呈现在排序后的编辑框中。排序顺序分“升序”和“降序”，排序方法总共7种，分别是：冒泡排序，简单选择排序，直接插入排序，希尔排序，快速排序，堆排序和基数排序。这些方法都是用c++实现的。还有一个搜索的功能，分别可以“线性搜索”和“二分搜索”，线性搜索时从排序前的数组中搜索，二分搜索时从排序后的数组中搜索，且必须为升序排序后的数组。 -Mainly in the MFC with VC6.0 on the completion of sorting algorithms and search algorithms: First of all pop up a dialog box where there are sort of pre-and post-sorting edit box, in the sorting box, enter the former editor of integer array, and then select the sort method, point sort button will sort the array presented in good order after the edit box in. Sort order into "ascending" and "descending" sorted a total of seven kinds, namely: bubble sort, simple selection sort, direct insertion sort, Shell sort, quick sort, heap sort, and radix sort. These methods are implemented using c++. There is also a search function, respectively, can "line search" and "binary search", a linear search from the sorted array before the search, two points from the sorted search after the search array, and must be sorted in ascending array.
Date : 2025-12-23 Size : 845kb User : 阿表
[Mathimatics-Numerical algorithms] zidongtixing DL : 0: 自动选取步长梯形法算法的C++程序，可求出积分的近似值。-A C++ program for Automatically select the step trapezoidal algorithm,which can calculate integral approximation.
Date : 2025-12-23 Size : 1kb User : CGQ
[Mathimatics-Numerical algorithms] 12-01bag DL : 0: 01背包问题问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树剪去。 -01 knapsack problem problem statement: given n kinds of items, and a backpack, the weight of the items i wi, the value of vi, backpack capacity C. Reasonable choice items into a backpack, making the total value of the items loaded backpack. Each item i select items loaded backpack, there are only two choices that loaded backpack or loaded backpack. Items i can not be loaded into a backpack many times not only loaded items i. The problem analysis: 01 knapsack problem is a selected subset of the problem and suitable for the tree represents a subset of the solution space of 01 knapsack problem. Search solution space tree, as long as its left son node is a feasible node, the search into the left subtree, right subtree may contain only into the right subtree search the optimal solution Otherwise, the right subtree cut.
Date : 2025-12-23 Size : 306kb User : Kahn