1) C-H-Review and Introduction a. Software Development i. High Quality Software ii. Code Reuse i i i . D o c u m e n t a t i o n 1. Precondition 2. Postcondition b. Abstract Data Types i. Abstraction and Data hiding i i . D e fi n i t i o n iii. ADTs vs data structures c. Pointers and Structs i. Syntax of array of pointers ii. Structs vs classes d. Dynamic Memory Allocation i. Memory leaks and their causes ii. Syntax of dynamic memory allocation/deallocation e. Objects and Classes i. Header vs .cpp file ii. Private vs. public 2) Array Based Lists a. Indroduction to Lists i . D e fi n i t i o n ii. ADT or data structure? b. Operations i. List Operations c. Implementations i. Array-based 1. Resizing arrays ii. Sorted array-based 1. Linear search 2. Binary search d . I t e r a t o r i. What is it for?

Array Based Lists

Introduction to Lists:
A list is an abstract data type (ADT) that stores a collection of elements. It allows efficient access to individual elements and supports various operations such as insertion, deletion, and search. Lists can be implemented using different data structures, with array-based and linked-list-based implementations being the most common.

Array-based lists store elements in a contiguous block of memory, with each element occupying a fixed-size slot. This allows for efficient random access to elements based on their index. The size of the array-based list is usually fixed, but it can be resized dynamically.

Operations:
Array-based lists support several operations, including:

– Insertion: Adding an element at a specific position in the list. This operation may require shifting all elements after the insertion point to accommodate the new element.

– Deletion: Removing an element from a specific position in the list. This operation may require shifting all elements after the deletion point to fill the gap left by the removed element.

– Access: Retrieving the value of an element at a specific position in the list. This operation can be performed directly using the index of the element.

– Search: Locating the position of a specific element within the list. This operation typically involves iterating through the elements until a match is found.

– Size: Determining the number of elements in the list. This operation can be performed by keeping track of the number of elements whenever an insertion or deletion occurs.

Implementations:
Array-based lists can be implemented using a static or dynamic approach. In the static approach, the size of the array is fixed, and if the list surpasses this size, a new array with a larger capacity is created, and the elements are copied to the new array. This resizing operation can be performed when the list is full or using a strategy to ensure a balance between memory usage and performance.

In the dynamic approach, the size of the array can be resized dynamically as the list grows or shrinks. This allows for more efficient memory utilization, but it comes with the overhead of resizing the array when needed.

Sorted array-based lists organize the elements in ascending or descending order, allowing for faster search operations using techniques such as linear search or binary search. Linear search compares each element sequentially until a match is found, while binary search divides the search space in half at each step, resulting in a logarithmic time complexity.

Iterator:
An iterator is a mechanism that allows sequential access to the elements of a list. It provides methods for moving to the next element and retrieving the current element. Iterators can be used to traverse the elements of a list in a specific order, such as from the beginning to the end or from the end to the beginning.

In summary, array-based lists are a popular data structure for implementing lists. They offer efficient random access to elements, support various operations, and can be implemented with static or dynamic resizing. Sorted array-based lists provide faster search operations, and iterators allow for sequential access to the elements.