3.chapter03数据描述-All.pptVIP

* 改进：就地安排箱子 templateclass T void ChainT::BinSort(int range) {// Sort by score. int b; // bin index ChainNodeT **bottom, **top; // initialize the bins bottom = new ChainNodeT* [range + 1]; top = new ChainNodeT* [range + 1]; for (b = 0; b = range; b++) bottom[b] = 0; // distribute to bins for (; first; first = first-link) {// add to bin b = first-data; if (bottom[b]) {// bin not empty top[b]-link = first; top[b] = first;} else // bin empty bottom[b] = top[b] = first; } // collect from bins into sorted chain ChainNodeT *y = 0; for (b = 0; b = range; b++) if (bottom[b]) {// bin not empty if (y) // not first nonempty bin y-link = bottom[b]; else // first nonempty bin first = bottom[b]; y = top[b];} if (y) y-link = 0; delete [] bottom; delete [] top; } 时间复杂度： 》第1个f o r循环：range 》第2个for 循环：n 》第3个f o r循环：range 》总的时间复杂度：n + range * 拓展：按不同的域排序 inline int F1(Node x) {return x.exam1;} inline int F2(Node x) {return x.exam2;} inline int F3(Node x) {return x.exam1 + x.exam2 + x.exam3;} void main(void) { Node x; ChainNode L; for (int i = 1; i = 20; i++) { x.exam1 = i/2; x.exam2 = 20 - i; x.exam3 = rand() % 100; x.name = i; L.Insert(0,x);} L.BinSort(10, F1); cout Sort on exam 1 endl; cout L endl; L.BinSort(20, F2); cout Sort on exam 2 endl; cout L endl; L.BinSort(130, F3); cout Sort on sum of exams endl; cout L endl; } templateclass T void ChainT::BinSort(int range, int(*value)(T x)) {// Sort by score. int b; // bin index ChainNodeT **bottom, **top; // initialize the bins bottom = new ChainNodeT* [range + 1]; top = new ChainNodeT* [range + 1]; for (b = 0; b = range; b++) bottom[b] = 0; // distribute to bins for (; first; first = first-link) {// add to bin b = value(first-data); if (bottom[b]) {// bin n