The document discusses sorting algorithms, abstract data types (ADTs), and linked lists. It describes selection sort and insertion sort algorithms for sorting arrays. It then explains that linked lists are a more flexible data structure than arrays and defines a singly linked list as an ADT with nodes that point to the next node in the list. Functions for typical linked list operations like insertion, deletion, checking if empty, and printing the list are discussed.

1. Sorting, ADTs, Linked Lists

7. Selection sort Example: small-to-large sort

10. Insertion Sort Remove Insert

11. Insertion sort Example (1 st unsorted item is automatially the 1 st sorted item)

15. ADTs ADT Data structure Operations Interface Users (you, and other project programmers)