搜索资源列表
zhaomigong_c
- 简单的演示,N的大小可以改变的,而且这个程序的速度还可以, 比以前我用递归写的那个快多了.如果N改得太大输出会有问题, 因为我用到gotoxy的,这个程序主要是练一个算法-simple demonstration, N size can be changed, but the rate of this procedure can also, than in the past I used to write a recursive that quicker. If N is too big
QuickSort
- 快速排序是对冒泡排序的一种改进的排序方法,是目前各种内部排序方法中较快的方法-Quick Sort Bubble Sort is a sort of an improved method is to sort a variety of internal methods quicker method
Template-Binary-Search
- 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) comparais