摘要： 图,数据结构 /**折半查找,折半排序,binary sort*/ private StorageA circular_shiftsB_; //original dataprivate StorageA alphabetizedB_; //sorted datapublic void alphabetizing() { alphabetizedB_ = new StorageA(); int alphabetized_count = 0; // we use binary search to find the proper place // to insert a line, // decl. 阅读全文