Sorting in C

[vishalsaxena17]

hello

Question :- If we have given  certain numbers ( 23, 21,19, 18,15,10) all the numbers are ALREADY SORTED . Now suppose we are given three sorting techniques (Bubble sort, Insertion sort, Quick sort) . If we have to find a number among the given numbers then which of the given sorting techniques wll be faster and why??

Thankx in advance.

[Computer Hope Admin]

Tough question (at least to me) to answer, because it could vary on how the algorithm is written to sort the data. But I believe most consider quick sort to be the fastest technique for sorting data. Check out the below page as it gives you examples of each of the types of sorting techniques and clicking on the image gives you a visual example of how the sort works.

http://www.cs.ubc.ca/~harrison/Java/sorting-demo.html

[Dias de verano]

Sure sounds like a homework question to me. It requires thought, rather than knowledge. If you understand how the mentioned sort algorithms work, the answer will be obvious (as it is to me). But I shall not tell you.