Dale - Computer Science Illuminated 339

Dale - Computer Science Illuminated 339 - 312 Chapter 9...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 312 Chapter 9 Abstract Data Types and Algorithms W W W Lists, stacks, queues, trees, and graphs are useful container ADTs. Each ADT has its own defining property and the operations that guarantee that property. All of these ADTs have operations to insert items and to delete items. Lists and trees have operations to find items within the structure. Sorting is the act of putting the items in a list into some sort of order. Selection sort, bubble sort, and Quicksort are three common sorting algo- rithms. If a list is in sorted order, a special searching algorithm called a binary search can be used to locate items in the list. Programming libraries are collections of classes and algorithms avail- able for a programmer to use. Before beginning to code, a programmer should check the library for the language to be used to see if there is a library class that already provides the needed behavior....
View Full Document

Ask a homework question - tutors are online