问题描述：
数据结构里的算法复杂程度怎么计算,如题
There is an algorithm with inserting an item to a ordered SeqList(顺序链表) and still keeping the SeqList ordered.The computational efficiency of this inserting algorithm is ( ).
A．O(log2n) B．O(1)
C．O(n) D．O(n2)
There is an algorithm with inserting an item to a ordered SeqList(顺序链表) and still keeping the SeqList ordered.The computational efficiency of this inserting algorithm is ( ).
A．O(log2n) B．O(1)
C．O(n) D．O(n2)
问题解答：
我来补答展开全文阅读