Looking back at their notes for a previous lecture on Data Abstraction, a classmate says: $"$We should design sorting to be more generic! Let's build an algorithm that takes an array of type Object rather than Comparable." Is this a good or bad idea?

Bad $-$ it doesn't make sense since we wouldn't know the order to put the elements into.

Bad $-$ it requires the use of a linked list to store data instead of an array.

Good $-$ that will follow the abstraction rules and make the sorting algorithm into an ADT.

Good $-$ it will mean that the algorithm will always run faster.