搜索资源列表
Bubble_S5
- The "binary search algorithm" is one of the quickest way for searching threw an array, the "linear search algorithm" makes "n" comparaisons for searching for an element inside a given array. The "binary search algorithm" only makes log2(n) comparaiso
Level_B
- 编制一维数组排序程序。数组大小n用全局变量定义，数组数据从文本文件中读入或随机生成。包含冒泡排序、选择排序、插入排序三种排序方法。程序能够选择使用任何一种方法排序。-The preparation of one-dimensional array sorting program. Array size n with the global variable definition, an array of data read from a text file or randomly generate
HeapSort(1)
- Heap Sort algorithm running on an array to sort its values
Countingsort
- Counting sort (ultra sort or math sort[1]) is a sorting algorithm which (like bucket sort) takes advantage of knowing the range of the numbers in the array to be sorted (array A). It uses this range to create an array C of this length.
Bucket_Sort
- Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorith
diag
- 滤波程序，从同事那里要的，大家一起交流学习-BADNELL & BURGESS D.A.M.T.P. CAMBRIDGE C C DIAGONALIZATION OF REAL SYMMETRIC N-BY-N MATRIX Z. C C METHOD: HOUSEHOLDER REDUCTION TO TRI-DIAGONAL FORM AND SHIFTED C QL ALGORITHM TO DETERMINE THE E-VALUES AND E-V
sort
- 本段代码不但可以给出一个数组中元素大小的排序，还可以同时输出各个元素的在数组的序号。-The sections of the code can be given not only a sort of elements in the array size, and can also output the serial number of each element in the array.
quicksort
- 自定义数组长度的快速排序-Quick sort of self-defined array length
Sort-Array-Calculator
- Sort Array Calculator
5
- 1、金币银币问题：有若干币值不同的金币和银币，任一金币的价值都大于所有银币，要求按价值由小到大排列所有货币。 模型分析：用数组存放所有的整数，奇数（偶数）代表金币，偶数（奇数）代表银币，按先偶后奇（先奇后偶）的顺序整理数组，然后分别对偶数列和奇数列进行排序。 将程序补充完整 2、十进制向任意进制（二进制，八进制，十六进制）数转换，输入十进制数n和一个进制类型x，将n转换为x进制输出-Gold coins: a number of different denominations of
Array
- 集成冒泡排序 快速排序 插入排序 三种经典排序方法源码 快速用C语言写的 别的都是JAVA 代码比较简单 有详细注释-Integrated bubble sort Quick Sort Insertion Sort the three classical Sort method source code fast are other Java code written in C language is relatively simple and detailed notes
Heap-Sort-Algorithm-Pseudo-Code
- The heapsort algorithm can be divided into two parts. In the first step, a heap is built out of the data. In the second step, a sorted array is created by repeatedly removing the largest element from the heap, and inserting it into the arra
Inversions
- Inversion counts the number of inversions in an integer array, using meager-sort as auxiliary.
Cpp1
- 输入指定个数的数据，对其进行快速排序，然后输入一个数据，在排序好序的数组中找到其位置。-Enter the specified number of data, its quick sort, and then enter a data sorted in order to find its place in the array.
sortquick
- 在linux环境下，采用mpi并行，C语言，实现对数组的快速排序。输出结果为数组从小到大排序的结果。可以实现多处理器共同对一组数的排序。-In linux environment, using mpi parallel, C language, to achieve quick sort the array. The output is an array of small to large results. Can achieve more together on a number of gro
BubbleSort
- 冒泡排序 (稳定)时间性能O(n^2) 输入: A:待排序数组 使用VS2010实现-Bubble Sort (Stable) time performance O (n ^ 2) Input: A: array to be sorted Achieved using VS2010
quicksort
- 用python写的快速排序代码，可以实现输入一组数组的快排-Write a quick sort using python code, you can enter a group to achieve an array of fast row
Ascending-Sort-a-Descending-Sort
- This Program can sort any array. Two method are disposal in this code . Ascending sort & Descending Sort .
Bubble-Sort
- Bubble Sort Method is a necessary Method to sort any array at least time . This Program publish for solving the issue .
sort
- 快速排序法和堆排序法Fortran90程序，其中快速排序法使用到了递归过程，因此对于堆栈要求较高(both Quicksort and Heapsort program are used for sort array. Note that a recursion process is used in Quicksort program, Thus it need require a relative high stack size.)