03/29 Lecture Material

John will be in Butte today for an "MSU For a Day" trip. Anne DeFrance will cover today's lecture.

Basic Sorting Techniques

• Selection Sort. Can be implemented non-recursively or recursively. The non-recursive implementation is more common. Always O(n^2).
• Insertion Sort. Can be implemented non-recursively or recursively. The non-recursive implementation is more common. Best case O(n), worst case O(n^2).
• Shell Sort. Understand the general idea.