vault backup: 2025-03-16 18:59:42

Data Structures/AI Notes/ADT Linear List.md

@@ -5,6 +5,7 @@ This study guide provides an in-depth overview of the Abstract Data Type (ADT) L
 ## 1. Overview of Linear Lists
 
 A linear list is a sequential collection of elements where each element can be accessed via an index. For instance, an instance of a linear list is represented as (e0, e1, e2, …, en-1), where:
+
 - $e_i$ denotes the i-th element.
 - $n$ is the finite size of the list, with n >= 0.
 - $e_0$ is the first element and en-1 is the last.
@@ -54,6 +55,7 @@ Element[0], Element[1], Element[2], ...
 ### 5.1 Array-Based Implementation
 
 The array-based implementation is straightforward:
+
 - **Class Declaration**: Define a class for the ArrayLinearList.
 - **Data Members**: Utilize a protected array (Object[]) for storing elements and a variable to track size.
 - **Constructor Example**: Create constructors to initiate the list with a default or user-defined size.
@@ -68,6 +70,7 @@ A linked list version of the linear list provides dynamic memory allocation, whe
 ## 6. Method Implementations in ADT Linear List
 
 Each method associated with the ADT Linear List is essential for its functionality:
+
 - **isEmpty()**: Returns true if the size is 0.
 - **size()**: Simply returns the count of elements.
 - **get(int index)**: Requires validating the index with *checkIndex()* before accessing the array.