算法的实践

Given an unsorted array a[0], a[2], ..., a[n-1], whose elements are not necessarily distinct, we need to find the k-th (k>0) minimal (maximal) element. The problem is nothing but to return the m

1. Fundamental algorithms: 1.1. Big number (plus, minus, multiply and divide), bit-manipulation. 1.2. Data structures: stack, queue, linked-list,  how they work together, how they change the style (