1) The values stored in an array have keys of a type for which relational operators are defined. (We also assume unique keys.) 2) Rearranges the elements into either ascending or descending within the array. (Slide 2)
What are key sorting considerations?
Efficiency - Number of comparisons - Number of swaps - Memory space required - Processing time Problem goals and requirements (Slide 3)