基础训练数列排序 （C++sort快排）

解题思路:

                            直接sort莽就完事!

注意事项:

                            读取功能有点僵硬,不够灵活

参考代码:

                #include<iostream>
                #include<algorithm>                                //sort的头文件
                int main()
                {
                            using namespace std;
                            int m,i=0;
                            int num[201];                    
                            cin>>m;
                            while(cin>>num[i])                
                            {
                                        i++;
                                        if(i==m)                          //如果输入的次数等于m大小就终止输入
                                               break;
                            }
                            sort(num,num+m);
                            for(i=0;i<m;i++)
                                       cout<<num[i]<<" ";            //输出带空格
                            return 0;
                }