user
Create a data structure for storing the scores of a high score list.


assistant
A data structure for storing the scores of a high score list could be an array or a hash table. The array would store the scores in a fixed, predefined order, while the hash table would store them in a key/value pair that would be sorted according to the score. The hash table is the more common and efficient data structure in this instance because it allows for quick retrieval of records and simpler sorting according to score, which is necessary for a high score list.