Write quicksort(numbers) returning a new sorted list.
Pick a pivot, split the rest into what is smaller and what is larger, sort both halves and join them.
Handle duplicates - they belong in the middle, and a solution that drops them will pass a careless test and fail this one. Do not use sorted or .sort().