This document compares vector lists and sequences. It discusses that sequences can be accessed by rank or position and defines vectors, lists, stacks and queues as types of sequences. It provides details on vector and list abstract data types (ADTs) including common operations. It describes an array-based implementation of vectors and a doubly linked list implementation of lists. Finally, it introduces the sequence ADT as a combination of vectors and lists and discusses implementing sequences with arrays and comparing the time complexities of common operations between array and linked list implementations.