// 寻找最大的k个数(堆).cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include<iostream>
using namespace std;
static const int N=100;
void MinHeapify(int origin[],int i,int heapsize);
void BuildMinHeap(int origin[],int heapsize);
int _tmain(int argc, _TCHAR* argv[])
{
int origin[N];
int k;
cout<<"origin array:"<<endl;
for(int i=0;i<N;i++)
{
origin[i]=rand()%(N+1);
cout<<origin[i]<<" ";
}
cout<<endl<<"请输入你想找最大数的个数: ";
cin>>k;
BuildMinHeap(origin,k);
for(int i=k;i<N;i++)
{
if(origin[i]>origin[0])
{
swap(origin[0],origin[i]);
MinHeapify(origin,0,k);
}
}
for(int j=0;j<N;j++)
{
cout<<origin[j]<<" ";
}
return 0;
}
void MinHeapify(int origin[],int i,int heapsize)//保持最小堆的性质
{
int smallest;
int l=2*i+1;
int r=2*i+2;
if(l<heapsize&&origin[i]>origin[l])
{
smallest=l;
}
else
{
smallest=i;
}
if(r<heapsize&&origin[r]<origin[smallest])
{
smallest=r;
}
if(smallest!=i)
{
swap(origin[i],origin[smallest]);
MinHeapify(origin,smallest,heapsize);
}
}
void BuildMinHeap(int origin[],int heapsize)//构建最小堆
{
for(int i=heapsize/2-1;i>=0;i--)
{
MinHeapify(origin,i,heapsize);
}
}
//
#include "stdafx.h"
#include<iostream>
using namespace std;
static const int N=100;
void MinHeapify(int origin[],int i,int heapsize);
void BuildMinHeap(int origin[],int heapsize);
int _tmain(int argc, _TCHAR* argv[])
{
int origin[N];
int k;
cout<<"origin array:"<<endl;
for(int i=0;i<N;i++)
{
origin[i]=rand()%(N+1);
cout<<origin[i]<<" ";
}
cout<<endl<<"请输入你想找最大数的个数: ";
cin>>k;
BuildMinHeap(origin,k);
for(int i=k;i<N;i++)
{
if(origin[i]>origin[0])
{
swap(origin[0],origin[i]);
MinHeapify(origin,0,k);
}
}
for(int j=0;j<N;j++)
{
cout<<origin[j]<<" ";
}
return 0;
}
void MinHeapify(int origin[],int i,int heapsize)//保持最小堆的性质
{
int smallest;
int l=2*i+1;
int r=2*i+2;
if(l<heapsize&&origin[i]>origin[l])
{
smallest=l;
}
else
{
smallest=i;
}
if(r<heapsize&&origin[r]<origin[smallest])
{
smallest=r;
}
if(smallest!=i)
{
swap(origin[i],origin[smallest]);
MinHeapify(origin,smallest,heapsize);
}
}
void BuildMinHeap(int origin[],int heapsize)//构建最小堆
{
for(int i=heapsize/2-1;i>=0;i--)
{
MinHeapify(origin,i,heapsize);
}
}