Answer:
<u>First test:</u> Give a list of disordered numbers to the sorting algorithm an examine if the output is correctly sorted.
<u>Second test:</u> Give a list of ordered numbers to the sorting algorithm an analyze if the output is still correctly ordered.
<u>Third test:</u> Give a list of ordered numbers and some non-numeric values to the sorting algorithm and check how is managed the exception in case of error or if the output is correctly ordered.
Answer: 545 words per 35 mins
Explanation:
The answer has to be true because everything makes sense