[试题]

E.堆排序:

procedure sift(i,m:integer);{调整以i为根的子树成为堆,m为结点总数}

var k:integer;

参考答案与解析:

相关试题

C.选择排序:procedure sort;var i,j,k:integer;

[试题]C.选择排序:procedure sort;var i,j,k:integer;

  • 查看答案
  • D. 冒泡排序procedure bubble_sort;var i,j,k:i

    [试题]D. 冒泡排序procedure bubble_sort;var i,j,k:integer;

  • 查看答案
  • 程序段如下:Dim i As Integer,s As IntegerFor i

    [单选题]程序段如下: Dim i As Integer,s As Integer For i=4 To 1 Step-1 s=s+i Next i Print s,i执行的结果是( )。A.10 0B.9 1C.10 1D.9 0

  • 查看答案
  • E. I needed to buy a digital camera, one

    [单选题]E.I needed to buy a digital camera, one that was simply good at taking good snaps (快照), maybe occasionally for magazines. Being the cautious type, I fancied a reliable brand. So I went on the net, spent 15 minutes reading product reviews on good webs

  • 查看答案
  • Dim i, j as integer 表明i和j都是整型变量。( )

    [主观题]D.im i, j as integer 表明i和j都是整型变量。( )

  • 查看答案
  • Dim i, j as integer 表明i和j都是整型变量。

    [判断题] Dim i, j as integer 表明i和j都是整型变量。A . 正确B . 错误

  • 查看答案
  • 有如下程序段: Dim I As Integer I=Int(£­3.25)执行

    [单选题]有如下程序段: Dim I As Integer I=Int(-3.25)执行后,I的返回值是A.-3B.-4C.3D.3.25

  • 查看答案
  • 堆排序

    [名词解释] 堆排序

  • 查看答案
  • 下列程序段的时间复杂度为()。for(i=0;i<m;i++)for(j=0;j<t;j++)e[i][j]=0;for(i=0;i<m;i++)for(j=0;j<t;j++)for(k=0;k<n

    [单选题]下列程序段的时间复杂度为()。for(i=0;i<m;i++)for(j=0;j<t;j++)e[i][j]=0;for(i=0;i<m;i++)fo

  • 查看答案
  • n皇后问题 procedure try(i:byte);var j:byte;

    [试题]n皇后问题procedure try(i:byte);var j:byte;

  • 查看答案
  • E.堆排序:procedure sift(i,m:integer);{调整以i为