Data Structures Question:

What is the easiest sorting method to use in data structures?

Data Structures Interview Question
Data Structures Interview Question

Answer:

The answer is the standard library function qsort(). It's the easiest sort by far for several reasons:
It is already written.
It is already debugged.
It has been optimized as much as possible (usually).
Void qsort(void *buf, size_t num, size_t size, int (*comp)(const void *ele1, const void *ele2));


Previous QuestionNext Question
What is the heap in data structures?What is the bucket size, when the overlapping and collision occur at same time?