Location:
Search - sort s
Search list
Description: 排序分组算法，虽然简单，值是基于灰度的算子，然后用平均值可使图片清晰；-a sort algorithm is simple, gray value is based on the operator, then the average will clear pictures;
Platform: |
Size: 26950 |
Author: zhou |
Hits:
Description: 排序分组算法，虽然简单，值是基于灰度的算子，然后用平均值可使图片清晰；-a sort algorithm is simple, gray value is based on the operator, then the average will clear pictures;
Platform: |
Size: 269312 |
Author: zhou |
Hits:
Description: STL sort（）函数使用详细介绍
包含ＳＴＬ算法介绍文档-STL sort () function using the STL algorithm contains a detailed introduction introduction document
Platform: |
Size: 2571264 |
Author: 朱明悦 |
Hits:
Description: CSDN上的优秀SQL编程代码集
这些SQL语句不是原创，均是本人从CSND上收集来的。由于时间关系，其中少量SQL语句的确性没有验证。
本文档对初学SQL Server的人很有帮助，其内容涵盖了触发器、作业、角色、备份还原、导入导出、游标、安全、索引排序、日期操作、XML、统计、交叉表、文件存储、分页、等等
-CSDN excellent SQL programming code set these SQL statements are not original, are I learned from the CSND collected. Because of the time, in which a small amount of SQL statements is true of the absence of a certification. This document for beginner SQL Server people helpful, its content covers the trigger, operations, roles, backup and restore, import, export, cursor, security, index to sort, date operations, XML, statistics, cross-tables, file storage, paging, etc.
Platform: |
Size: 568320 |
Author: 浩哥 |
Hits:
Description: it s a sorting c code which is using many kinds of sort algorithm
Platform: |
Size: 219136 |
Author: LEE |
Hits:
Description: it s other version of sorting program coded by C-it s other version of sorting program coded by C++
Platform: |
Size: 269312 |
Author: LEE |
Hits:
Description: #include<iostream>
using namespace std
int s[100005]
int main()
{
int i,j,k,sum,n
while(scanf(" d",&n)!=EOF)
{
for(i=0 i<n i++)
scanf(" d",&s[i])
sort(s,s+n)
for(i=sum=0 i<n i++)
{
sum += s[i] * (n - i)
}
printf(" d\n",sum)
}
return 0
}
-# include <iostream> using namespace std int s [100005] int main () (int i, j, k, sum, n while (scanf ( " d" , & n)! = EOF) (for (i = 0 i <n i++)
scanf(" d",&s[i])
sort(s,s+n)
for(i=sum=0 i<n i++)
{
sum+= s[i]* (n- i)
}
printf(" d\n",sum)
}
return 0
}
Platform: |
Size: 279552 |
Author: 七七十四 |
Hits:
Description: 二路归并算法的代码,用来排序，文件后缀名是c-a program to sort files under visusl C++ s environment
Platform: |
Size: 9216 |
Author: zhou |
Hits:
Description: 几个常用排序算法的实现，包括选择、起泡、选择和希尔排序等。-The realization of several common sorting algorithms, including the selection, bubble, selection, and Hill' s ranking.
Platform: |
Size: 4096 |
Author: zlh |
Hits:
Description: C++各种排序的算法比较，各种算法的优劣-C++ Comparison of various sorting algorithms, each algorithm' s strengths and weaknesses ... ...
Platform: |
Size: 1979392 |
Author: tang |
Hits:
Description: it s a c++ code for hyper quick sort
Platform: |
Size: 1024 |
Author: kamlesh |
Hits:
Description: 排序时间对比 含冒泡 快排 堆排 归并 等等
并可以随即数据测试各个算法的时间 适合noip acm 等初级选手-sort s time
Platform: |
Size: 2048 |
Author: fate_wheel |
Hits:
Description: Write a program to sort an array using bubble sort. Home work should be submitted as rollno.s in the folder on
Indus/common. It will be tested in the next lab.-Write a program to sort an array using bubble sort. Home work should be submitted as rollno.s in the folder on Indus/common. It will be tested in the next lab.
Platform: |
Size: 1024 |
Author: 任红伟 |
Hits:
Description: 编写一个C编程，实现这样的功能：从键盘输入任意个整数，以0作为结束标志，对这个整数序列从小到大排序，并输出排序后的结果。
题目分析：在这里应用链表作为数据的存储结构。因为链表的存储空间是分配在系统的动态存储区的，因此可以在程序执行时动态的分配内存。这样就可以轻松的解决动态的数列访问问题。-Write a C program, to achieve this functionality: any integer from the keyboard, with 0 as the end mark of the integer sequence from small to large order, and outputs the sorted results. Topic analysis: Here the application list as a data storage structure. Because the list of storage space is allocated in the system s dynamic storage area, so the program can be executed in the dynamically allocated memory. This can easily solve the problem of dynamic access to the data series.
Platform: |
Size: 1024 |
Author: 小陈 |
Hits:
Description: 实现几种典型排序方法：a) Insertion Sort；b) Selection Sort；c) Bubble Sort；d) Rank Sort 分析算法的时间复杂度并测量其实际运行时间。-Order to achieve several typical methods: a) Insertion Sort b) Selection Sort c) Bubble Sort d) Rank Sort algorithm' s time complexity analysis and measure its actual running time.
Platform: |
Size: 4096 |
Author: Yuan |
Hits:
Description: It s an document on sorting algorithms
Platform: |
Size: 393216 |
Author: murthyb |
Hits:
Description: 有关排序课程的C++算法，能够合理高效地对不同课程进行排序，非常实用。-It s about a method which can put the courses into order efficiently.
Platform: |
Size: 1333248 |
Author: zl |
Hits:
Description: matlab中关于S函数用法的简单示例，帮助初学者快速理清S函数编程格式-simple example on the usage of the S function in the matlab help beginners sort out the S-function programming format
Platform: |
Size: 8192 |
Author: 周连俊 |
Hits:
Description: 河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
Eratosthenes筛选求质数
超长整数运算（大数运算）
长 PI
最大公因数、最小公倍数、因式分解
完美数
阿姆斯壮数
最大访客数
中序式转后序式（前序式）
后序式的运算
关于赌博
洗扑克牌（乱数排列）
Craps赌博游戏
约瑟夫问题（Josephus Problem）
集合问题
排列组合
格雷码（Gray Code）
产生可能的集合
m元素集合的n个元素子集
数字拆解
排序
得分排行
选择、插入、气泡排序
Shell 排序法 - 改良的插入排序
Shaker 排序法 - 改良的气泡排序
Heap 排序法 - 改良的选择排序
快速排序法（一）
快速排序法（二）
快速排序法（三）
合并排序法
基数排序法
搜寻
循序搜寻法（使用卫兵）
二分搜寻法（搜寻原则的代表）
插补搜寻法
费氏搜寻法
矩阵
稀疏矩阵
多维矩阵转一维矩阵
上三角、下三角、对称矩阵
奇数魔方阵
4N 魔方阵
2(2N+1) 魔方阵
对C语言的学习非常有用。-Tower of Hanoi
Fibonacci row
Pascal triangle
Three-color chess
Mice have gone astray Officer (a)
Mice have gone astray Officer (2)
Knights go board
Eight Queen
Eight of silver
Game of Life
String to check
Color, tri-color Towers of Hanoi
Knapsack problem (Knapsack Problem)
The number of operator
Monte Carlo method for PI
Eratosthenes screening and quality
Long integer arithmetic (large numbers operation)
Long PI
The greatest common divisor, least common multiple, factoring
Perfect number
Armstrong number
The maximum number of visitors
Sequence type (pre-order type) in sequence rotary
After the order type of computing
On gambling
Wash cards (random number order)
Craps gambling game
The problem of Joseph (Josephus Problem)
Collection of problems
Permutations and combinations
Gray code (Gray Code)
Produce may be the collection of
m elements of a collection of n elements in a subset of
Digital dismantling
Sort
Score Ranking
Select, insert, bubble sort
S
Platform: |
Size: 64512 |
Author: 李艳文 |
Hits:
Description: 对顺序表的快速排序算法中，如何选取一个界值（又称为轴元素），影响着快速排序的效率，而且界值也并不一定是被顺序表中的一个元素。例如，我们可以用被划分序列中所有元素的平均值作为界值。编写算法实现以平均值为界值的快速排序方法。-On the the sequence table fast sorting algorithm, how to select a critical value (also known as the axis elements) affect the efficiency of the quick sort, and the critical value is not necessarily an element in the sequence table. For example, we can use the average of all of the elements in the sequence is divided as a boundary value. Write algorithms to achieve the quicksort method to the average for the sector.
Platform: |
Size: 1024 |
Author: hac |
Hits:
« 12
3
4
5
6
7
8
9
10
...
17
»