【编程能力不行？那就写啊！】数组排序

//-----** Java Version **-----
import java.util.Arrays;

public class MainClass
{
    public static void main(String args[]) throws Exception
    {
        int array[] = {1,2,-2,5,3,10,4,6,7,9};
        Arrays.sort(array);
        printArray("数组排序可得： ",array);
        int index=Arrays.binarySearch(array,2);
        System.out.println("元素 2 在第 "+index+" 个位置");
    }
    private static void printArray(String message,int [] array)
    {
        System.out.println(message+ "[length: " + array.length + "]");
        for(int i=0;i<array.length;++i)
        {
            if(i!=0)
                System.out.print(",");
            System.out.print(array[i]);
        }
        System.out.println();
    }
}

数组排序可得： [length: 10]
-2,1,2,3,4,5,6,7,9,10
元素 2 在第 2 个位置
[Finished in 1.4s]

//-----** C++ Version **-----
#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
    int a[10]={1,2,-2,5,3,10,4,6,7,9};
    sort(a,a+10);
    cout<<" 数组的排序结果是： "<<"[length：10 ]"<<endl;
    for(int i=0;i<10;++i)
    {
        if(i!=9)
            cout<<a[i]<<",";
        else
            cout<<a[i]<<endl;
    }
    return 0;
}

Last login: Thu Dec  7 16:36:25 on ttys000
HustWolf:~ zhangzhaobo$ /Users/zhangzhaobo/program/C++/Array_Sort ; exit;
 数组的排序结果是： [length：10 ]
-2,1,2,3,4,5,6,7,9,10
logout
Saving session...
...copying shared history...
...saving history...truncating history files...
...completed.

[进程已完成]