DS & A (Lists - Array Based)
| CHAPTER 9 | "The List Data Structure " , Yep, that's exactly what today's chapter is gonna be about. So, without any further ado let's have a sneak peek of today's chapter. Intro to Lists List ADT List Implementation (Array-Based) Pros and Cons of Array-Based List Pre-requisite: C++ Intro to Lists Credits: <Link 1> <Link 2> Definition A list in Data Structures can be defined as a sequence of ordered values. General Properties: Can be Sorted or Unsorted Can be Finite or Infinite Note: We will be working with finite lists. Example The List is of size n. Each element has a datatype Atomic Data Type ( Discussed in Chapter 1 ) or Structure Data Type ( Discussed in Chapter 1 ) The List can be empty. (Empty Lists) List length is the number of elements stored. The beginning of the List is called Head. The end of the List is called Tail. Basic functions of a List Retrieve value. Insert/Delete/Modify va