Clojure's persistent data structures are implemented as trees and tries and have O(log32 n) access complexity where n is the number of elements.
確定! 回上一頁