0001 template <typename T> void List<T>::insertionSort(LNP<T> h, LNP<T> t) {
0002    for (LNP<T> r = h->succ, s = r->succ; r != t; r = s, s = r->succ) //反复在有序前缀(h,r)
0003       r->moveSucc(search(h, r->data, r)); //内找到不大于[r]的最靠后者，并将[r]移至紧邻其后
0004 } //insertionSort