Search - c select

Search - c select - List

[Data structs] 数据结构中所用的8种排序方法 DL : 0: 本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.
Date : 2025-12-23 Size : 76kb User : 吴晓辉
[Data structs] 排序程序 DL : 0: 利用C语言实现，8种排序算法！例如：插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序！-using C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
Date : 2025-12-23 Size : 3kb User : 叶兆源
[Data structs] dp DL : 0: (1).问题描述：旅行商问题某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 (2).程序设计要求： a. 设计一个动态规划算法 b. 任给一个输入实例，能输出最短路程及其路线 c. 能用图形演示旅行商的推销路线输入要测试的文件名，如TSP6.txt,程序将利用动态规划求解该问题，给出最佳线路，并用图形演示。-(1). Problem Description: A salesman traveling salesman problem to a number of cities to sell commodities, known distance between cities (or travel). He has to select a departure from the resident, through every city once again, and finally returned to the resident s line, bringing the total distance (or travel) the smallest. (2). Program design requirements: a. the design of a dynamic programming algorithm to an input b. any examples, can output the shortest distance and the line c. use graphical presentation of the traveling salesman selling line of input to test the file name, such as TSP6 . txt, the procedure will use dynamic programming to solve the problem, given the best lines, and graphics presentation.
Date : 2025-12-23 Size : 10kb User : 小明
[Data structs] paixu DL : 0: 这是用C语言实现插入、选择、冒泡排序，对大家学习数据结构有所帮助-This is the C language used to insert, select, Bubble Sort, the U.S. study data structure help
Date : 2025-12-23 Size : 1kb User : Schumi
[Data structs] c2 DL : 1: 这是一个关于百鸡百钱问题的程序实现，选择c语言实现。-This is a study on the issue of money hundred hundred chickens realize the procedure, select the c language.
Date : 2025-12-23 Size : 2kb User : summer
[Data structs] paixu DL : 0: 数据结构用C语言实现的各种排序方法，有插入排序，堆排序，归并排序，快速排序，链式基数排序，冒泡排序，希尔排序，选择排序，折半排序。-Data structure using C language to achieve a variety of sequencing methods, have insertion sort, heap sort, merge sort, quicksort, chain base sort, Bubble Sort, Hill sort, select sort, sort half.
Date : 2025-12-23 Size : 4kb User : 韩杰
[Data structs] paixu DL : 0: 2008软件公司面试题:排序大全：简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序（利用递归）-2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive)
Date : 2025-12-23 Size : 221kb User : chen
[Data structs] C++paixu DL : 0: 编写一个程序，用菜单选择各种排序算法，对所给数据进行排序，并显示排序前与排序后的结果。-The preparation of a program, using menu to select a variety of sorting algorithms, to data of the sort, and display the sort order before and after results.
Date : 2025-12-23 Size : 8kb User : yyfy
[Data structs] paixu DL : 0: 基于C++的排序各种排序操作,包括快速排序,shell排序,随机排序,选择排序等-C++ based on a variety of sort of sorting operation, including the quick sort, shell sort, random order, select Sort, etc.
Date : 2025-12-23 Size : 1.3mb User : 大槛哥
[Data structs] 1108 DL : 0: 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高，即n ?i=1pi xi 取得最大值。约束条件为n ?i =1wi xi≤c 和xi?[ 0 , 1 ] [ 1≤i≤n]。-At 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. N items from a backpack loaded, select the items, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight of the backpack should not exceed capacity, the best means by loading articles into the highest value, that is, n? I = 1pi xi to obtain the maximum value. Constraint condition for n? I = 1wi xi ≤ c and xi? [0, 1] [1 ≤ i ≤ n].
Date : 2025-12-23 Size : 1kb User : samuel
[Data structs] d DL : 0: 1． 0-1背包问题在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高 -1. 0-1 knapsack problem at 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. N items from a backpack loaded, select the items, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight of the backpack should not exceed capacity, the best load is the value of items packed by the highest
Date : 2025-12-23 Size : 141kb User : 松柏长青
[Data structs] Maze DL : 0: 数据结构中迷宫问题的求解，迷宫问题.vcproj 这是使用应用程序向导生成的 VC++ 项目的主项目文件。它包含生成该文件的 Visual C++ 的版本信息，以及有关使用应用程序向导选择的平台、配置和项目功能的信息。迷宫问题.cpp 这是主应用程序源文件。 StdAfx.h, StdAfx.cpp 这些文件用于生成名为迷宫问题.pch 的预编译头 (PCH) 文件和名为 StdAfx.obj 的预编译类型文件。 -Data structure to solve the problem in the maze, the maze problem. Vcproj This is using an application wizard to generate the VC++ project the main project document. It contains the document to generate Visual C++ version information, as well as applications relating to the use of the wizard select the platform, configuration and project features. Maze problem. Cpp This is the main application source file. StdAfx.h, StdAfx.cpp these files used to generate a maze called the question. Pch precompiled header (PCH) files and named StdAfx.obj type of pre-compiled files.
Date : 2025-12-23 Size : 152kb User : 张艳彬
[Data structs] heibaiqi.c DL : 0: 用C实现的黑白棋源程序，有人工智能的人机对战，用算法树深度搜索，原始的C图形界面，turboC或TC编译器运行。网络上实现黑白棋大多选择VC++，并没有用C实现并且有人工智能的程序。-Implementation of Othello with C source code, there is artificial intelligence, human-machine gaming, with the depth of search tree algorithm, the original C-graphical interface, turboC or TC compiler run. Most of the network to achieve Othello select VC++, and did not realize and have artificial intelligence using C program.
Date : 2025-12-23 Size : 4kb User : 吴振华
[Data structs] c DL : 0: 数据结构c语言程序，排序问题，筛选问题，逆阵问题等等，内容多多请君选择-C programming language data structures, scheduling problems, screening problems, inverse problems, and so, a lot of inviting select content
Date : 2025-12-23 Size : 303kb User : philip
[Data structs] Select DL : 0: 第k小元素，分治法实现。。C-K-small elements, divide and conquer implementation. . C++. . . . .
Date : 2025-12-23 Size : 1.81mb User : 王
[Data structs] select DL : 0: 线性时间选择算法的C++实现，带有详细讲解和注释。-Linear time selection algorithm in C++, with detailed explanations and comments.
Date : 2025-12-23 Size : 3.87mb User : lijia
[Data structs] code DL : 0: C++ 实现从文件中抽取近似字符串,近似的意义是指编辑距离和 Jaccard 距离小于阈值-C++ select similar strings from file the similar string is define by ED and Jaccard distance
Date : 2025-12-23 Size : 3kb User : 李莉
[Data structs] select-sort DL : 0: 数据结构排序算法之选择排序法，此算法用C++编程语言书写特别适合初学数据结构的人学习。-Selection Sort sorting algorithm data structure, this algorithm using C++ written in a programming language particularly suitable for beginner data structure of human learning
Date : 2025-12-23 Size : 1kb User : 满达
[Data structs] c DL : 0: 问题描述有多个可供选择的村庄坐落在笔直的高速公路旁。高速公路被表示为一个整数轴，每个村庄有一个整数坐标表示其位置。两个村庄不会在同一个位置。在两个位置之间的距离是其整数坐标的差的绝对值。现在要选择一些村庄，在这些村庄里建小学。小学位置的选择应该使每个村庄和离该村庄最近的小学之间的距离的总和最小。注意小学只能建立在某个村庄，小学的位置视为该村庄的位置。实验任务请你写一个程序，给出的村庄的位置和要建立的小学的数量，计算每个村庄和它最近的小学之间的距离尽可能少的总和。-Problem Description There are multiple options villages situated beside the straight highway. Highway axis is represented as an integer, each The village has a integer coordinates represent its position. Two villages will not be in the same position. The distance between the two positions is its The absolute value of the difference between integer coordinates. Now we want to a number of villages, built primary schools in these villages. Select the primary location should make every village and village The sum of the minimum distance of the nearest village primary school between. Note that can only be built in a village primary school, primary school location deemed village Location village. Experimental task You write a program, given the number of positions to be established villages and primary schools, calculated for each village and its nearest The distance between the primary minimal sum.
Date : 2025-12-23 Size : 31kb User : zzz
[Data structs] c-language--select-menu. DL : 0: C语言课程设计的设计题目，实现菜单的选择功能。-C language curriculum design of a design, implement menu.
Date : 2025-12-23 Size : 295kb User : 文龙

« 12 »