HeapSort
来源:互联网 发布:2017三级数据库试题库 编辑:程序博客网 时间:2024/04/29 14:42
#include < iostream >
using namespace std;
int a[11] = { 0,12,14,2,3,0,29,17,16,36,7 };
void heapSort(int i,int n);
int main ( )
{
int i,k,n=10;
for ( i=n/2; i>=1; i--)
heapSort( i, n );
for ( k=n; k>=1; k--)
{
heapSort( 1, k );
swap (a[k],a[1]);
}
for ( i=1; i<=n; i++)
cout<<a[i]<<" ";
return 0;
}
void heapSort(int i,int n)
{
int tmp=a[i];
int j=i*2;
while ( j<=n )
{
if ( j<n&&a[j]<a[j+1] )
j++;
if ( tmp<a[j] )
{
a[i]=a[j];
i=j;
j=i*2;
}
else
break;
}
a[i]=tmp;
}
- Heapsort
- Heapsort
- HeapSort
- heapsort
- HeapSort
- HeapSort
- HeapSort
- heapsort
- heapsort
- heapsort
- HeapSort
- Heapsort
- HeapSort
- heapSort
- HeapSort
- heapSort
- HeapSort
- heapsort
- aa
- static的用法
- 关于POWERPOINT,这个一定要记下来
- Jar 入门 翻译了一下jar的说明 并说明了怎样生成jar
- debian 安装fcitx输入法
- HeapSort
- OSGI学习笔记收藏
- OSGI-link
- Prim
- Prim
- OSGI and J2EE
- john the ripper
- POJ3522 Slim Span
- 使用Zoundry进行测试了下!