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));

quick sort technique it s a eay way of sorting mtd

bubble()
It is already debugged.
It is already written

qsort().it is debugged,writeen for easy purpose

qsort().
Because it is already witten and debug.
But most important thing is the performance of qsort().
qsort() has order of complexity o(nlog(n)) where bubble() has o(n).
Hence qsort has better performance than bubble sort.

The Selection sort is the easiest method of sorting,in this method,to sort data in ascending order,the 0th element of the array is compared with all other elements,if 0th element is found to be bigger than other ,then their places are interchanged,elsethe smallest element is placed at 0th position.

If you have the better answer, then send it to us. We will display your answer after the approval.

Name :*
Email Id :*
Answer :*
Verification Code	Not readable? Load New Code
Enter the above shown code:*
	Inform me about updated answers to this question