各类排序C++实现(冒泡,选择,插入,快排,归并,堆排)(二)

2014-11-24 11:53:43 · 作者: · 浏览: 4
main()
{
int i;
cin >> n;
for(i = 1; i <= n; i++)
cin >> a[i];
HeapSort(a, n);
for(i = 1; i <= n; i++) cout << a[i] << " ";
cout << endl;
return 0;
}
作者:sdj222555