Summary

This chapter covered heterogeneous data structures such as ordered lists and unordered lists with code examples. The Ordered lists section covered sorting slices by single key, multiple keys, and sort.Slice. Slices are sorted by making the array of struct elements implement the sort.Sort interface. Unordered lists were described as linked lists with values that are not ordered.

The next chapter will cover dynamic data structures such as dictionaries, TreeSets, sequences, synchronized TreeSets, and mutable TreeSets.