- 博客(5)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 Algorithms_6_HashTable
A hash table is a generalization of the simpler notion of an ordinary array. Directly addressing into an ordinary array makes effective use of our ability to examine an arbitrary position in an array
2008-03-10 21:04:00
728
原创 Algorithm 5_Counting_Sort
Algorithm 5_Counting_Sort： Counting sort assumes that each of the n input elements is an integer in the range 0 to k,for some intefer k.When k=O(n),the soer runs in big theta(n) time.The basic
2008-03-08 16:01:00
922
原创 Algorithm 4_Heap_Sort
First of all,the binary heap is an array that can be viewd as a nearly completely binary tree.Each node of the tree corresponds to an element of the arrau that stores the value in the node. We ca
2008-03-06 21:13:00
796
原创 Algorithm 3_Quick_Sort
Choose an index named middleIndex between fist Index and last index of an array which is to be sort.We can get a rearranged array that has the following jfeatures: all elements from first index to m
2008-03-05 13:25:00
797
原创 Algorithm_2_Merge_Sort
In the card-playing motif,suppose we have two piles of cards face up on a table.Each pile is sorted,with the smallest cards on top.We wish to merge the two piles into a single sorted output pile,whi
2008-03-04 19:48:00
884
一点linux资料,入门，涉及到各个方面，新手看看没坏处：）20字～～还没到～～～～～～
2009-08-20
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人