下列是順序存儲(chǔ)線性表排序的算法問:此算法的時(shí)間復(fù)雜性為()。
A.O(n) B.(n2) C.(n*i) D.(n*j)
A.隊(duì)首 B.隊(duì)首或隊(duì)尾 C.隊(duì)尾 D.任意位置
A. front = =rear B. (front-1)%n= =rear C. (rear+1)%n= =front D. (rear-1)%n= = front