Section 5.1 Objectives
- To be able to explain and implement sequential search and binary search.
- To be able to explain and implement selection sort, bubble sort, merge sort, quick sort, insertion sort, and Shell sort.
- To understand the idea of hashing as a search technique.
- To understand the map abstract data type.
- To implement the map abstract data type using hashing.
You have attempted of activities on this page.