blocks|key|908531|text|在C%2B%2B0x/11中，我们得到了数组重载的std::begin和std::end：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|908532|#include+<algorithm>

int+main(){
++int+v[2000];
++std::sort(std::begin(v),+std::end(v));
}|code-block|syntax|javascript|908533|如果您无法访问C%2B%2B0x，那么自己编写它们并不困难：|908534|//+for+container+with+nested+typedefs,+non-const+version
template<class+Cont>
typename+Cont::iterator+begin(Cont&+c){
++return+c.begin();
}

template<class+Cont>
typename+Cont::iterator+end(Cont&+c){
++return+c.end();
}

//+const+version
template<class+Cont>
typename+Cont::const_iterator+begin(Cont+const&+c){
++return+c.begin();
}

template<class+Cont>
typename+Cont::const_iterator+end(Cont+const&+c){
++return+c.end();
}

//+overloads+for+C+style+arrays
template<class+T,+std::size_t+N>
T*+begin(T+(&arr)[N]){
++return+&arr[0];
}

template<class+T,+std::size_t+N>
T*+end(T+(&arr)[N]){
++return+arr+%2B+N;
}|908535|entityMap|0|LINK|mutability|MUTABLE|url|http://en.cppreference.com/w/cpp/iterator/begin|1|http://en.cppreference.com/w/cpp/iterator/end^0|L|A|W|8|L|A|0|W|8|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@$9|Z|A|10|B|C]|$9|11|A|12|B|C]]|D|@$9|13|A|14|1|15]|$9|16|A|17|1|18]]|E|$]]|$1|F|3|G|5|H|7|19|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|1A|8|@]|D|@]|E|$]]|$1|M|3|N|5|H|7|1B|8|@]|D|@]|E|$I|J]]|$1|O|3|-4|5|6|7|1C|8|@]|D|@]|E|$]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]]]

In C++0x/11 we get <a href="http://en.cppreference.com/w/cpp/iterator/begin"><code>std::begin</code></a> and <a href="http://en.cppreference.com/w/cpp/iterator/end"><code>std::end</code></a> which are overloaded for arrays:

<pre><code>#include &lt;algorithm&gt;

int main(){
 int v[2000];
 std::sort(std::begin(v), std::end(v));
}
</code></pre>

If you don't have access to C++0x, it isn't hard to write them yourself:

<pre><code>// for container with nested typedefs, non-const version
template&lt;class Cont&gt;
typename Cont::iterator begin(Cont&amp; c){
 return c.begin();
}

template&lt;class Cont&gt;
typename Cont::iterator end(Cont&amp; c){
 return c.end();
}

// const version
template&lt;class Cont&gt;
typename Cont::const_iterator begin(Cont const&amp; c){
 return c.begin();
}

template&lt;class Cont&gt;
typename Cont::const_iterator end(Cont const&amp; c){
 return c.end();
}

// overloads for C style arrays
template&lt;class T, std::size_t N&gt;
T* begin(T (&amp;arr)[N]){
 return &amp;arr[0];
}

template&lt;class T, std::size_t N&gt;
T* end(T (&amp;arr)[N]){
 return arr + N;
}
</code></pre>

blocks|key|908287|text|#include+<algorithm>
static+const+size_t+v_size+=+2000;
int+v[v_size];
//+Fill+the+array+by+values
std::sort(v,v%2Bv_size);+|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|908288|在C%2B%2B11中|unstyled|offset|length|908289|#include+<algorithm>
#include+<array>
std::array<int,+2000>+v;
//+Fill+the+array+by+values
std::sort(v.begin(),v.end());+|908290|entityMap|0|LINK|mutability|MUTABLE|url|http://en.cppreference.com/w/cpp/container/array^0|0|1|5|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|T|8|@]|9|@$G|U|H|V|1|W]]|A|$]]|$1|I|3|J|5|6|7|X|8|@]|9|@]|A|$B|C]]|$1|K|3|-4|5|F|7|Y|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<pre><code>#include &lt;algorithm&gt;
static const size_t v_size = 2000;
int v[v_size];
// Fill the array by values
std::sort(v,v+v_size); 
</code></pre>

In <a href="http://en.cppreference.com/w/cpp/container/array" rel="noreferrer">C++11</a>:

<pre><code>#include &lt;algorithm&gt;
#include &lt;array&gt;
std::array&lt;int, 2000&gt; v;
// Fill the array by values
std::sort(v.begin(),v.end()); 
</code></pre>

blocks|key|908344|text|如果你不知道大小，你可以使用：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|908345|std::sort(v,+v+%2B+sizeof+v+/+sizeof+v[0]);|code-block|syntax|javascript|908346|即使你知道数组的大小，用这种方式编码也是个好主意，因为如果以后改变数组的大小，这将减少出现bug的可能性。|908347|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

If you don't know the size, you can use:

<pre><code>std::sort(v, v + sizeof v / sizeof v[0]);
</code></pre>

Even if you do know the size, it's a good idea to code it this way as it will reduce the possibility of a bug if the array size is changed later.

blocks|key|908403|text|你可以用std::sort(v,+v+%2B+2000)对它进行排序|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|908404|entityMap^0|4|M|0^^$0|@$1|2|3|4|5|6|7|H|8|@$9|I|A|J|B|C]]|D|@]|E|$]]|$1|F|3|-4|5|6|7|K|8|@]|D|@]|E|$]]]|G|$]]

You can sort it <code>std::sort(v, v + 2000)</code>

blocks|key|908553|text|//It+is+working
#include<iostream>
using+namespace+std;
void+main()
{
++++int+a[5];
++++int+temp=0;
++++cout<<"Enter+Values"<<endl;
++++for(int+i=0;i<5;i%2B%2B)
++++{
++++++++cin>>a[i];
++++}
++++for(int+i=0;i<5;i%2B%2B)
++++{
++++++++for(int+j=0;j<5;j%2B%2B)
++++++++{
++++++++++++if(a[i]>a[j])
++++++++++++{
++++++++++++++++temp=a[i];
++++++++++++++++a[i]=a[j];
++++++++++++++++a[j]=temp;
++++++++++++}
++++++++}
++++}
++++cout<<"Asending+Series"<<endl;
++++for(int+i=0;i<5;i%2B%2B)
++++{
++++++++cout<<endl;
++++++++cout<<a[i]<<endl;
++++}


++++for(int+i=0;i<5;i%2B%2B)
++++{
++++++++for(int+j=0;j<5;j%2B%2B)
++++++++{
++++++++++++if(a[i]<a[j])
++++++++++++{
++++++++++++++++temp=a[i];
++++++++++++++++a[i]=a[j];
++++++++++++++++a[j]=temp;
++++++++++++}
++++++++}
++++}
++++cout<<"Desnding+Series"<<endl;
++++for(int+i=0;i<5;i%2B%2B)
++++{
++++++++cout<<endl;
++++++++cout<<a[i]<<endl;
++++}


}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|908554|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>//It is working
#include&lt;iostream&gt;
using namespace std;
void main()
{
 int a[5];
 int temp=0;
 cout&lt;&lt;"Enter Values"&lt;&lt;endl;
 for(int i=0;i&lt;5;i++)
 {
 cin&gt;&gt;a[i];
 }
 for(int i=0;i&lt;5;i++)
 {
 for(int j=0;j&lt;5;j++)
 {
 if(a[i]&gt;a[j])
 {
 temp=a[i];
 a[i]=a[j];
 a[j]=temp;
 }
 }
 }
 cout&lt;&lt;"Asending Series"&lt;&lt;endl;
 for(int i=0;i&lt;5;i++)
 {
 cout&lt;&lt;endl;
 cout&lt;&lt;a[i]&lt;&lt;endl;
 }


 for(int i=0;i&lt;5;i++)
 {
 for(int j=0;j&lt;5;j++)
 {
 if(a[i]&lt;a[j])
 {
 temp=a[i];
 a[i]=a[j];
 a[j]=temp;
 }
 }
 }
 cout&lt;&lt;"Desnding Series"&lt;&lt;endl;
 for(int i=0;i&lt;5;i++)
 {
 cout&lt;&lt;endl;
 cout&lt;&lt;a[i]&lt;&lt;endl;
 }


}
</code></pre>

blocks|key|692680|text|事情就是这么简单。C%2B%2B在标准模板库中提供了一个名为sort的函数，它的运行速度比手工编写的快速排序快20%25到50%25。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|692681|下面是它的用法示例代码：|692682|std::sort(arr,+arr+%2B+size);|code-block|syntax|javascript|692683|entityMap^0|Q|4|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|R|8|@]|D|@]|E|$]]|$1|H|3|I|5|J|7|S|8|@]|D|@]|E|$K|L]]|$1|M|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|N|$]]

It is as simple as that&nbsp;... C++ is providing you a function in STL (Standard Template Library) called <code>sort</code> which runs 20% to 50% faster than the hand-coded quick-sort.

Here is the sample code for it's usage:

<pre><code>std::sort(arr, arr + size);
</code></pre>

blocks|key|692692|text|//sort+by+number
bool+sortByStartNumber(Player+&p1,+Player+&p2)+{
++++return+p1.getStartNumber()+<+p2.getStartNumber();
}
//sort+by+string
bool+sortByName(Player+&p1,+Player+&p2)+{
++++string+s1+=+p1.getFullName();
++++string+s2+=+p2.getFullName();
++++return+s1.compare(s2)+==+-1;
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|692693|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>//sort by number
bool sortByStartNumber(Player &amp;p1, Player &amp;p2) {
 return p1.getStartNumber() &lt; p2.getStartNumber();
}
//sort by string
bool sortByName(Player &amp;p1, Player &amp;p2) {
 string s1 = p1.getFullName();
 string s2 = p2.getFullName();
 return s1.compare(s2) == -1;
}
</code></pre>

blocks|key|692762|text|对于C%2B%2B20中即将推出的Ranges库，您可以使用|type|unstyled|depth|inlineStyleRanges|entityRanges|data|692763|ranges::sort(arr);|code-block|syntax|javascript|692764|直接，其中arr是一个内置数组。|offset|length|style|CODE|692765|entityMap^0|0|0|5|3|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Q|8|@$I|R|J|S|K|L]]|9|@]|A|$]]|$1|M|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|N|$]]

With the Ranges library that is coming in C++20, you can use

<pre><code>ranges::sort(arr);
</code></pre>

directly, where <code>arr</code> is a builtin array.

blocks|key|908630|text|没有std::sort的排序方法|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|908631|//+sorting+myArray+ascending
int+iTemp+=+0;
for+(int+i+=+0;+i+<+ARRAYSIZE;+i%2B%2B)
{
++++for+(int+j+=+i+%2B+1;+j+<=+ARRAYSIZE;+j%2B%2B)
++++{
++++++++//+for+descending+sort+change+'<'+with+'>'
++++++++if+(myArray[j]+<+myArray[i])
++++++++{
++++++++++++iTemp+=+myArray[i];
++++++++++++myArray[i]+=+myArray[j];
++++++++++++myArray[j]+=+iTemp;
++++++++}
++++}
}|code-block|syntax|javascript|908632|Run完整示例：|908633|#include+<iostream>+//+std::cout,+std::endl+/*+http://en.cppreference.com/w/cpp/header/iostream+*/
#include+<cstdlib>++//+srand(),+rand()++++++/*+http://en.cppreference.com/w/cpp/header/cstdlib+*/
#include+<ctime>++++//+time()+++++++++++++++/*+http://en.cppreference.com/w/cpp/header/ctime+*/


int+main()
{
++++const+int+ARRAYSIZE+=+10;
++++int+myArray[ARRAYSIZE];

++++//+populate+myArray+with+random+numbers+from+1+to+1000
++++srand(time(0));
++++for+(int+i+=+0;+i+<+ARRAYSIZE;+i%2B%2B)
++++{
++++++++myArray[i]+=+rand()%25+1000+%2B+1;
++++}

++++//+print+unsorted+myArray
++++std::cout+<<+"unsorted+myArray:+"+<<+std::endl;
++++for+(int+i+=+0;+i+<+ARRAYSIZE;+i%2B%2B)
++++{
++++++++std::cout+<<+"["+<<+i+<<+"]+->+"+<<+myArray[i]+<<+std::endl;
++++}
++++std::cout+<<+std::endl;

++++//+sorting+myArray+ascending
++++int+iTemp+=+0;
++++for+(int+i+=+0;+i+<+ARRAYSIZE;+i%2B%2B)
++++{
++++++++for+(int+j+=+i+%2B+1;+j+<=+ARRAYSIZE;+j%2B%2B)
++++++++{
++++++++++++//+for+descending+sort+change+'<'+with+'>'
++++++++++++if+(myArray[j]+<+myArray[i])
++++++++++++{
++++++++++++++++iTemp+=+myArray[i];
++++++++++++++++myArray[i]+=+myArray[j];
++++++++++++++++myArray[j]+=+iTemp;
++++++++++++}
++++++++}
++++}

++++//+print+sorted+myArray
++++std::cout+<<+"sorted+myArray:+"+<<+std::endl;
++++for+(int+i+=+0;+i+<+ARRAYSIZE;+i%2B%2B)
++++{
++++++++std::cout+<<+"["+<<+i+<<+"]+->+"+<<+myArray[i]+<<+std::endl;
++++}
++++std::cout+<<+std::endl;

++++return+0;
}|908634|entityMap|0|LINK|mutability|MUTABLE|url|http://cpp.sh/52vsb^0|2|9|0|0|0|3|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@$9|X|A|Y|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|Z|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|10|8|@]|D|@$9|11|A|12|1|13]]|E|$]]|$1|M|3|N|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|O|3|-4|5|6|7|15|8|@]|D|@]|E|$]]]|P|$Q|$5|R|S|T|E|$U|V]]]]

sorting method without <code>std::sort</code>:

<pre><code>// sorting myArray ascending
int iTemp = 0;
for (int i = 0; i &lt; ARRAYSIZE; i++)
{
 for (int j = i + 1; j &lt;= ARRAYSIZE; j++)
 {
 // for descending sort change '&lt;' with '&gt;'
 if (myArray[j] &lt; myArray[i])
 {
 iTemp = myArray[i];
 myArray[i] = myArray[j];
 myArray[j] = iTemp;
 }
 }
}
</code></pre>

<a href="http://cpp.sh/52vsb" rel="nofollow">Run</a> complete example:

<pre><code>#include &lt;iostream&gt; // std::cout, std::endl /* http://en.cppreference.com/w/cpp/header/iostream */
#include &lt;cstdlib&gt; // srand(), rand() /* http://en.cppreference.com/w/cpp/header/cstdlib */
#include &lt;ctime&gt; // time() /* http://en.cppreference.com/w/cpp/header/ctime */


int main()
{
 const int ARRAYSIZE = 10;
 int myArray[ARRAYSIZE];

 // populate myArray with random numbers from 1 to 1000
 srand(time(0));
 for (int i = 0; i &lt; ARRAYSIZE; i++)
 {
 myArray[i] = rand()% 1000 + 1;
 }

 // print unsorted myArray
 std::cout &lt;&lt; "unsorted myArray: " &lt;&lt; std::endl;
 for (int i = 0; i &lt; ARRAYSIZE; i++)
 {
 std::cout &lt;&lt; "[" &lt;&lt; i &lt;&lt; "] -&gt; " &lt;&lt; myArray[i] &lt;&lt; std::endl;
 }
 std::cout &lt;&lt; std::endl;

 // sorting myArray ascending
 int iTemp = 0;
 for (int i = 0; i &lt; ARRAYSIZE; i++)
 {
 for (int j = i + 1; j &lt;= ARRAYSIZE; j++)
 {
 // for descending sort change '&lt;' with '&gt;'
 if (myArray[j] &lt; myArray[i])
 {
 iTemp = myArray[i];
 myArray[i] = myArray[j];
 myArray[j] = iTemp;
 }
 }
 }

 // print sorted myArray
 std::cout &lt;&lt; "sorted myArray: " &lt;&lt; std::endl;
 for (int i = 0; i &lt; ARRAYSIZE; i++)
 {
 std::cout &lt;&lt; "[" &lt;&lt; i &lt;&lt; "] -&gt; " &lt;&lt; myArray[i] &lt;&lt; std::endl;
 }
 std::cout &lt;&lt; std::endl;

 return 0;
}
</code></pre>

blocks|key|692584|text|使用排序函数对C%2B%2B进行排序|type|unstyled|depth|inlineStyleRanges|entityRanges|data|692585|#include+<bits/stdc%2B%2B.h>
+using+namespace+std;

vector+<int>+v[100];

int+main()
{
++sort(v.begin(),+v.end());
}|code-block|syntax|javascript|692586|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

C++ sorting using sort function

<pre><code>#include &lt;bits/stdc++.h&gt;
 using namespace std;

vector &lt;int&gt; v[100];

int main()
{
 sort(v.begin(), v.end());
}
</code></pre>

blocks|key|908699|text|使用C%2B%2B+std::sort函数：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|908700|#include+<algorithm>
using+namespace+std;

int+main()
{
++vector<int>+v(2000);
++sort(v.begin(),+v.end());
}|code-block|syntax|javascript|908701|entityMap|0|LINK|mutability|MUTABLE|url|http://en.cppreference.com/w/cpp/algorithm/sort^0|6|9|6|9|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@$9|T|A|U|B|C]]|D|@$9|V|A|W|1|X]]|E|$]]|$1|F|3|G|5|H|7|Y|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|Z|8|@]|D|@]|E|$]]]|L|$M|$5|N|O|P|E|$Q|R]]]]

Use the C++ <a href="http://en.cppreference.com/w/cpp/algorithm/sort" rel="nofollow noreferrer"><code>std::sort</code></a> function:

<pre><code>#include &lt;algorithm&gt;
using namespace std;

int main()
{
 vector&lt;int&gt; v(2000);
 sort(v.begin(), v.end());
}
</code></pre>

blocks|key|908564|text|你可以使用，|type|unstyled|depth|inlineStyleRanges|entityRanges|data|908565|+std::sort(v.begin(),v.end());|code-block|syntax|javascript|908566|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

you can use,

<pre><code> std::sort(v.begin(),v.end());
</code></pre>

How to use standard template library <code>std::sort()</code> to sort an array declared as 
<code>int v[2000]</code>;

Does C++ provide some function that can get the begin and end index of an array?

How to use std::sort to sort an array in C++

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋 

腾讯云代码助手

CODING DevOps

Cloud Studio

SDK中心

API中心

命令行工具

如何使用标准模板库std::sort()对声明为int v[2000]的数组进行排序；C++是否提供了一些可以获取数组的开始和结束索引的函数？

问如何使用std::sort对C++中的数组进行排序
EN

回答 12

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何使用std::sort对C++中的数组进行排序EN

回答 12

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何使用std::sort对C++中的数组进行排序
EN