liken的专栏

There are N number kinds of stamps with different worth. At this moment, you are allowed to use the same kinds of stamps several times, but the total number of uses of all stamps is restricted to less

Mr. Lee has to travel various offices abroad to assist branches of each place. But he has a problem. The airfare would be real high as all offices he has to visit are in foreign countries. He wants to

An investor intends to earn maximum profits by investing money in many companies. However, the investment unit is 100 million won. The more each company return profits the more the investor earns prof

Though prime numbers used to belong to pure mathematics traditionally, they’re more related now to our real world thanks to the development of cryptology and computers in late 20th century.The pub

转自：What is satellite information in data structures?Question

Question:从两个已排序的

转自：http://www.careercup.com/question?id=5679059790987264

http://test.scripts.psu.edu/users/d/j/djh300/cmpsc465/notes-4985903869437/solutions-to-some-homework-exercises-as-shared-with-students/3-solutions-clrs-11.pdfExercise 11.1-1Suppose  that  a  dynam

There are two boxes, A and B with shelves, a and b. Following the , there are marbles with numbers written from 1 to N to every shelf of the two boxes.Box A12 1

转自：http://blog.youkuaiyun.com/appleprince88/article/details/11881323

There are an individual match and group match in Taekwondo. An individual match is between two players and a group match is repetition of matches between two different individual players of each group

Long time ago, there lived Hansel and Gretel. And a strange witch took Hansel to the deep forest to get rid of him. Smart Hansel abandoned scraps of bread that he’d got little by little on the way to

The R&D center  formulated a  sequence from a spectrum according to electron orbital changes. In order to create the sequence, the initial number, N & the square number, P are required. When N & P are

The farmer wants to return home, Farm No. 1 from Farm No. N. The farmer who is very tired is going to return home as fast as he can.In the farms he cultivates, there is the total number of T of tw

Mr. K has made healthy juice for his colleagues. This has been made of 100% natural vitamin C especially for overcoming fatigue. With powder from various natural fruits in it, it has diverse colors, p

参考：http://stackoverflow.com/questions/1589556/when-to-choose-rb-tree-b-tree-or-avl-tree/1589587#1589587http://stackoverflow.com/questions/647537/b-tree-faster-than-avl-or-redblack-tree/1195288#1

10.2-1Can you implement the dynamic-set operation INSERTon a singly linked list in O(1) time? How about DELETE?使用尾指针：insert(LinkList *tail, ElemType x){ Node* p = new Node; p->value = x

蛇形数类似这样的数组8   1   2   3   4    5   6   7   828 29 30 31 32 33 34   927 48 49 50 51 52 35 1026 47 60 61 62 53 36 1125 46 59 64 63 54 37 1224 45 58 57 56 55 38 1323 44 43 42 41 40 39 14

转自算法导论中文版第9.2节线性时间期望的选择算法randomized-select的期望运行时间为Θ(n)。该算饭是一个随机算法，只处理划分的一边。伪代码RANDOMIZED-SELECT(A, p, r, i)1    if p = r2        then return A[p]3    q = RANDOMIZED-PARTATION

QuickSort是一种原地排序算法，不稳定。最坏情况是O(n2)，平均和最好情况是O(nlogn)/* * #include * * void swp(int *a, int *b) * { * if (a != b) { * *a = *a^*b; * *b = *a^*b; * *a = *a^*b; * } *

离散数学第7章定理2带有n个顶点的树含有n-1条边。定理3带有i个内点的正则m元树含有n=mi+1个顶点。定理4一个正则m元树若带有(i)n个顶点，则带有i=(n-1)/m个内点和l=[(m-1)n+1]/m个树叶；(ii)i个内点，则带有n=mi+1个顶点和l=(m-1)i+1个树叶；(iii)l个树叶，则带有n=(ml-1)/(m-1)个

Electronics Service Center was visited by a total of N customersService Center has a total of M employees.To those employees that customers visit in order to get in line, line stands, if the servi

Picking up JewelsThere is a maze that has one entrance and one exit.Jewels are placed in passages of the maze.You want to pick up the jewels after getting into the maze through the entranc

You are making “sky map” to represent constellation (group of starts) in the sky.In each element, 1 means star, 0 means empty.And in a constellation, each start should have at least one connect

选择排序是一种原地排序算法。时间复杂度为O(n2)#include void swp(int *a, int *b){ *a = *a^*b; *b = *a^*b; *a = *a^*b;}int main(void){ int i; int a[10] = { 8, 5, 2, 6, 9, 3, 1, 4, 0, 7 };

堆排序分为最大堆和最小堆，分别是二叉树根节点和子树的根节点比节点大或小，将数组转化为完全二叉树。http://mindlee.net/2011/07/27/heap-sort-and-priority-queue/迭代部分参考wiki的修改http://zh.wikipedia.org/wiki/%E5%A0%86%E6%8E%92%E5%BA%8F#include

偶图定义若把简单图G的顶点集分成两个不相交的非空集合V1和V2，使得图里的每一条条边都连接着V1里的一个顶点与V2里的一个顶点(因此G里没有边是连接着V1里的两个顶点或V2里的两个顶点)，则G称为偶图。当次条件成立，称(V1,V2)为G的顶点集的一个二部划分。偶图也称为二部图，二分图。判断简单图是否为偶图一个简单图是偶图，当且仅当能够对图中的每一个顶点赋以两种不同的颜色，而不让

快速排序的随机化版本快速排序的平均情况运行时间与最佳情况的运行时间很接近，而不是非常接近于最坏情况运行时间。快速排序的平均情况是指假定输入数据的所有排列是等可能的。可以在算法中加入随机化的成分，以便对于所有输入，它均能获得较好的平均情况性能。很多人都认为，快速排序的随机化版本是对足够大的输入的理想选择。RANDOMIZED-PARTITION(A, p, r)1

Bus RouteMr. Shim received a request to improve bus routes of a complex city and he researched the bus operation policy of this city.In the city, it operates a bus for all roads from a dep

基数排序(radix sort)是一种用在老师穿卡机上的算法。一张卡片有80列，每一列可以在12个位置中的任一处穿孔。排序器可以被机械的“程序化”，以便对一叠卡片中的每一列进行检查，再根据穿孔的位置将它们分别入12个盒子里。这样，操作员就可以逐个地将它们收集起来，其中第一个位置穿孔的放在最上面，第二个位置穿孔的其次，等等。对十进制数字来说，每列中只用到10个位置。一个d位数占用d个列。

转自:mosfet.isu.edu/classes/cs385f10/resources/Introduction%20to%20Algorithms(Instructor's%20Manual).pdf(CLRS 9.3-7) Describe an O(n) algorithm that, given a set S of n distinct numbersand a posit

转自:http://dreamkorea.tistory.com/attachment/jk37.pdf‎9.3-6The kth quantiles of an n-element set are the k-1 order statistics that divide thesorted set into k equal-sized sets (to within1). Give

Partial Sequence of the Longest IncreaseA problem to find a partial sequence of the longest increase is well-known in the algorism field.This sequence is defined as the longest sequence among

转自http://discrete.gr/complexity/IntroductionA lot of programmers that make some of the coolest and most useful software today, such as many of the stuff we see on the Internet or use daily

转自算法导论第二版8.2节计数排序不是比较排序。计数排序是用了输入元素的实际值来确定它们在数组中的位置。计数排序假设n个输入数据中的每一个都是介于0到k之间的整数，此外k为某个整数。当k=O(n)时，计数排序的运算时间为Θ(n)。注意这个算法的前提是每个数据都是0计数排序的基本思想就是对每个输入元素x，确定出小于x的元素个数。有了这个信息，就可以把x直接放到他在最终输出数组

插入排序时一种原地排序算法，稳定的伪代码INSERT-SORT(A)1    for i 2        do key 3        j 4        while j > 0 and A[j] > key5            do A[j+1] 6            j 7        A[j+1] = key#inclu

冒泡排序void bubble(int a[], int size){ int i, j, tmp; for (i = 0; i < size; i++) { for (j = size; j >= i; j--) { if (a[j] < a[i]) { tmp = a[i]; a[i] = a[j]; a[j] = tmp;