heapsort.cpp
来自「A heap is a binary tree satisfying the f」· C++ 代码 · 共 9 行
CPP
9 行
#include <iostream>
#include <iomanip>
using namespace std;
/********* Restore the sequence of numbers *********/
int Restore(int i, int j, int *sort)
{
int k,temp;
if(j%2 == 0){ //*** judge who is the parent which have children
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?