<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Java Lists :: CC 210 Textbook</title>
    <link>https://textbooks.cs.ksu.edu/cc210/15-collections/04-java/03-list/video/index.html</link>
    <description>Resources Slides Video Script First, let’s take a look at one of the most commonly used data structures from the Java collections library, the list. A list is a data type that can store any number of elements in a sequence. In addition, lists can be searched, elements can be removed, and lists are easily sortable. In Java, lists serve a similar function to arrays. The biggest difference is that arrays must be statically sized when we create them, whereas lists can grow and shrink as needed. Similarly, it is easy to remove an element from the middle of a list without leaving a gap, whereas the same action in an array requires shifting elements manually. Java includes two different types of lists, ArrayList and LinkedList. We won’t get into the difference in this course, but it mainly has to do with performance. In a later class, we’ll explore how to understand the differences between these two implementations of the list data structure.</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <atom:link href="https://textbooks.cs.ksu.edu/cc210/15-collections/04-java/03-list/video/index.xml" rel="self" type="application/rss+xml" />
  </channel>
</rss>