Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

你可以试试，stl sort效率很高

Posted by wywcgs at 2007-02-27 14:54:07 on Problem 1002
In Reply To:我想应该是自己写要比STL快不少吧。 Posted by:Nowitzki at 2007-02-27 14:40:23

Followed by:

假如我要按照一个二维数组的[i][0]排序，但排序的同时我也要交换[i][1]的位置，那我是否就只能自己编quicksort而不能用stl了呢？ (0) Nowitzki 2007-03-01 10:56:04
- 这种情况就把array[N][2]写成一个struct。 (41) Acsaga 2007-03-01 11:31:27
  - 那这样怎么样用sort函数呢？ (51) testdirk 2007-03-01 12:04:52
    - Re:那这样怎么样用sort函数呢？ (76) aCSaga 2007-03-01 12:37:28
      - 谢谢兄弟！ (86) testdirk 2007-03-01 13:37:57
      - Re:那这样怎么样用sort函数呢？ (22) yanzhengfei 2009-07-22 16:50:09

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator