单选

设求解某问题的递归算法如下:    F(int n){        if n==1{            Move(1);        }        else{            F(n-1);            Move(n);            F(n-1);        }    }    求解该算法的计算时间时,仅考虑算法Move所进行的计算为主要计算,且Move为常数级算法,设算法Move的计算时间为k,当n=5时,算法F的计算时间为(42)。

  • A.7k
  • B.15k
  • C.31k
  • D.63k
参考答案
您可能感兴趣的试题

ASCII is a 7-bit code used to represent numeric, alphabetic, and special printable characters. It also includes codes for control characters, which are(75).

  • A.printable or displayable
  • B.not printable or displayable
  • C.not printable but displayable
  • D.printable but not displayable

By means of multiple pipeline to carry out multiple processing, this technology is called(71).

  • A.Multiple pipeling
  • B.Superpipeline
  • C.Superscalar
  • D.Very long instruction word

An instruction that uses indrect addressing mustt contain an address of memory where(69).

  • A.data is stored
  • B.a pipeline stall will be executed
  • C.a page fault is addressed
  • D.another address is stored

The sorting method described by the code is called(67).

  • A.Insertion sort
  • B.Selection sort
  • C.Radix sort
  • D.Merge sort
¥

订单号:

遇到问题请联系在线客服

订单号:

遇到问题请联系在线客服