Skip to ContentGo to accessibility pageKeyboard shortcuts menu
OpenStax Logo

Highlights from this chapter include:

  • Lists are mutable and can be easily modified by using append(), remove(), and pop() operations.
  • Lists are iterable and can be iterated using an iterator or element indexes.
  • The sort() operation arranges the elements of a list in ascending order if all elements of the list are of the same type.
  • The reverse() operation reverses a list.
  • The copy() method is used to create a copy of a list.
  • Lists have built-in functions for finding the maximum, minimum, and summation of a list for lists with only numeric values.
  • Lists can be nested to represent multidimensional data.
  • A list comprehension is a compact way of creating a new list, which can be used to filter items from an existing list.

At this point, you should be able to write programs using lists.

Function Description

append(element)

Adds the specified element to the end of a list.

remove(element)

Removes the specified element from the list if the element exists.

pop()

Removes the last element of a list.

max(list)

Returns the maximum element of the list specified.

min(list)

Returns the maximum element of the list specified.

sum(list)

Returns the summation of a list composed of numbers.

sort()

Sorts a list on which the method is called in ascending order.

reverse()

Reverses the order of elements in a list.

copy()

Makes a complete copy of a list.
Table 9.1 Chapter 9 reference.
Citation/Attribution

This book may not be used in the training of large language models or otherwise be ingested into large language models or generative AI offerings without OpenStax's permission.

Want to cite, share, or modify this book? This book uses the Creative Commons Attribution License and you must attribute OpenStax.

Attribution information
  • If you are redistributing all or part of this book in a print format, then you must include on every physical page the following attribution:
    Access for free at https://openstax.org/books/introduction-python-programming/pages/1-introduction
  • If you are redistributing all or part of this book in a digital format, then you must include on every digital page view the following attribution:
    Access for free at https://openstax.org/books/introduction-python-programming/pages/1-introduction
Citation information

© Jul 30, 2024 OpenStax. Textbook content produced by OpenStax is licensed under a Creative Commons Attribution License . The OpenStax name, OpenStax logo, OpenStax book covers, OpenStax CNX name, and OpenStax CNX logo are not subject to the Creative Commons license and may not be reproduced without the prior and express written consent of Rice University.

This book utilizes the OpenStax Python Code Runner. The code runner is developed by Wiley and is All Rights Reserved.