CUJ:标准库:标准库中的排序算法[12]

[入库:2005年8月18日] [更新:2007年3月25日]

本文简介:选择自 taodm 的 blog

  vector<pair<string, double> > results;

  results.push_back(do_sort(v));

  results.push_back(do_qsort(v));

  results.push_back(do_stable_sort(v));

  results.push_back(do_heap_sort(v));

  results.push_back(do_list_sort(v));

  results.push_back(do_set_sort(v));

 

  report(results, std::cout);

 

  return 0;

}

 

 

listing 2: measurements — sorting a vector<string> (only main is shown; everything else is the same as in listing 1)

int main(int argc, const char** argv)

{

  if (argc != 2) {

    std::cerr << "usage: "

              << argv[0] << " <file>"

              << std::endl;

    return 1;

  }

 

  std::ifstream in(argv[1]);

本文关键:CUJ、STL、排序、Matthew Austern
  相关方案
Google
 

本站最佳浏览方式为 分辨率 1024x768 IE 6.0(或更高版本的 IE浏览器)

go top