wk2(bigo)

 0    2 词汇卡    up804653
下载mp3 打印 检查自己
 
问题 English 答案 English
explain o(1)
开始学习
The method runs in O(1) time (ie “constant time”) relative to its input. The list could contain 1 item or 1,000 items but the algorithm is still only required to do one print.
explain o(n)
开始学习
The method runs in O(n) time (ie “linear time”) relative to its input. If the list has 10 items – then have to print 10 items If the list has 1,000 items – then have to print 1,000 items

看到类似的抽认卡:

wk5&&6 (LinkedLists)

您必须登录才能发表评论。