If the most commonly used operations are to visit a random posit

If the most commonly used operations are to visit a random position and to insert and delete the last element in a linear list, then sequential storage works the fastest. ~@[](2)

答案：TRUE