Đang chuẩn bị liên kết để tải về tài liệu:
Lecture ECE 250 - Algorithms and data structures: Lists

An Abstract List (or List ADT) is linearly ordered data where the programmer explicitly defines the ordering. We will now look at our first abstract data structure: Relation - explicit linear ordering, operations, implementations of an abstract list with linked lists and arrays, memory requirements, strings as a special case, the STL vector class. | VATER LOO o ENGINEERING w Lists 2 Outline We will now look at our first abstract data structure - Relation explicit linear ordering - Operations - Implementations of an abstract list with Linked lists Arrays - Memory requirements - Strings as a special case - The STL vector class ATERLO ENGINEERING 3.1 I Lists 3 Definition An Abstract List or List ADT is linearly ordered data where the programmer explicitly defines the ordering We will look at the most common operations that are usually - The most obvious implementation is to use either an array or linked list - These are however not always the most .