单选

在内部排序中,通常要对被排序数据序列进行多趟扫描。各种排序方法有其不同的排序实施过程和(时间)复杂性。对给定的整数序列(541,132,984,746,518,181,946,314,205,827)进行从小到大的排序时,采用冒泡排序的第一趟扫描结果是(61)。设被排序数据序列有n个元素,冒泡排序算法的复杂性是(62)。

  • A.(541,132,827,746,518,181,946,314,205,984)
  • B.(205,132,314,181,518,746,946,984,541,827)
  • C.(541,132,984,746,827,181,946,314,205,518)
  • D.(132,541,746,518,181,946,314,205,827,984)
参考答案
您可能感兴趣的试题

(95)

  • A.time
  • B.power
  • C.speed
  • D.overhead

(94)

  • A.burdened
  • B.influenced
  • C.destroyed
  • D.mitigated

(92)

  • A.many
  • B.almost
  • C.a lot of
  • D.nearly

(93)

  • A.most
  • B.many
  • C.much
  • D.a lot

(90)

  • A./etc/nis.conf
  • B./etc/dns.conf
  • C./ere/named.conf
  • D./etc/resolv.conf

(89)

  • A./ete/named.conf
  • B./etc/host.conf
  • C./etc/dns.conf
  • D./etc/resolv.conf

(87)

  • A./etedserviees.conf
  • B./etc/metd.conf
  • C./etc/services
  • D./etc/host.conf

(88)

  • A./etc/hosts.allow
  • B./etc/hosts.denv
  • C./etc/access.conf
  • D./etc/inetd.conf
¥

订单号:

遇到问题请联系在线客服

订单号:

遇到问题请联系在线客服