Quicksort is a sorting algorithm invented by C
Radix sort is a sorting algorithm which sorts key/value pairs with integer keys by ordering digits.
Why quicksort or introsort or any comparison-based sorting algorithm is more common than radix-sort
Why quicksort is more popular than radix-sort?
Which of the two consumes more memory is not defined and depends on the input sequence to be sorted as well as on algorithm tuning parameters see the comments to one of the answers to why quicksort is more popular than radix-sort
Memory saving alternatives to CUDA Thrust sort_by_key?