6. Sorting and Searching

Sorting and Searching

• 6.1. Objectives
• 6.2. Searching
• 6.3. The Sequential Search
  • 6.3.1. Analysis of Sequential Search
• 6.4. The Binary Search
  • 6.4.1. Analysis of Binary Search
• 6.5. Hashing
  • 6.5.1. Hash Functions
  • 6.5.2. Collision Resolution
  • 6.5.3. Implementing the Map Abstract Data Type
  • 6.5.4. Analysis of Hashing
• 6.6. Sorting
• 6.7. The Bubble Sort
• 6.8. The Selection Sort
• 6.9. The Insertion Sort
• 6.10. The Shell Sort
• 6.11. The Merge Sort
• 6.12. The Quick Sort
• 6.13. Summary
• 6.14. Key Terms
• 6.15. Discussion Questions
• 6.16. Programming Exercises

You have attempted 1 of 1 activities on this page