Implement an abstract data structure in a high-level language, including sorting and searching.
DefinitionImplementation should make use of the program statements available with the language employed, including
- sorting (e.g., selection, insertion, merge, or bubble) to arrange the components of an array in either ascending or descending order
- searching (e.g., sequential or binary) to examine the elements in order according to the implementing technique and proceeding until a match is found.
Related Standards of Learning
The student will design and apply computer programs to solve practical problems in mathematics arising from business and applications in mathematics.
The student will implement pre-defined algorithms, including sort routines, search routines, and simple animation routines.
The student will select and implement appropriate data structures, including arrays (one- and/or two-dimensional) and objects.
The student will describe and apply sorting algorithms and coding algorithms used in sorting, processing, and communicating information.