作业帮堆排序中第一个元素没排序?#includeusing namespace std;#define MaxSize 100typedef int KeyType;typedef struct {KeyType key;}RecType;void sift(RecType R[],int low,int high){int i=low,j=2*i;RecType tmp=R[i];while(j
来源：学生作业帮助网 编辑：作业帮 时间：2024/10/06 15:35:01
![堆排序中第一个元素没排序?#includeusing namespace std;#define MaxSize 100typedef int KeyType;typedef struct {KeyType key;}RecType;void sift(RecType R[],int low,int high){int i=low,j=2*i;RecType tmp=R[i];while(j](/uploads/image/z/6091623-63-3.jpg?t=%E5%A0%86%E6%8E%92%E5%BA%8F%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E6%B2%A1%E6%8E%92%E5%BA%8F%3F%23includeusing+namespace+std%3B%23define+MaxSize+100typedef+int+KeyType%3Btypedef+struct+%7B%05KeyType+key%3B%7DRecType%3Bvoid+sift%28RecType+R%5B%5D%2Cint+low%2Cint+high%29%7B%05int+i%3Dlow%2Cj%3D2%2Ai%3B%05RecType+tmp%3DR%5Bi%5D%3B%05while%28j)
xROKA =b!]WD u)]w63 JA#?fJ_fgS_L{D1ʴGu˼5nd{dЇ3!E kHIEBMd4} D
Z
,βQ0
u` ŵ8j9@CIw>\iJEmp1:1DϡyQ(Q# h)ҋʇ:ߡ9Wϱ64b%? q_
9WSPEs
R;%=F |Yf0鬓j]".=hj IB.I_.̋IY\X2X89gLVag_rVB`nҼaB8dPbF ð
堆排序中第一个元素没排序?#includeusing namespace std;#define MaxSize 100typedef int KeyType;typedef struct {KeyType key;}RecType;void sift(RecType R[],int low,int high){int i=low,j=2*i;RecType tmp=R[i];while(j
堆排序中第一个元素没排序?
#include
using namespace std;
#define MaxSize 100
typedef int KeyType;
typedef struct
{
KeyType key;
}RecType;
void sift(RecType R[],int low,int high)
{
int i=low,j=2*i;
RecType tmp=R[i];
while(j
堆排序中第一个元素没排序?#includeusing namespace std;#define MaxSize 100typedef int KeyType;typedef struct {KeyType key;}RecType;void sift(RecType R[],int low,int high){int i=low,j=2*i;RecType tmp=R[i];while(j
主要原因是你的排序算法是从下标1开始,主函数中下标从0开始,改成一样的就可以了,下面是改过的主函数：
void main()
{
RecType R[MaxSize];
KeyType a[MaxSize];
cout