r there any two sorting alogrithms.. among which we cant decide which one is the best??

Answer 1

These are among the most popular sorting algorithms

Bubble sort
Insertion sort
Shell sort
Merge sort
Heapsort
Quicksort
Radix sort



Hope this helps..

Answer 2

ok, now that you rephrased your question, it's a little more understandable.

Sorting algorithms are often generalized for optimum situations (unlimited memory, similar processing capabilities of the hardware, etc...) so that the only thing being compared is the time it takes for them to run. According to the first site i linked, Quicksort comes out on top. According to the Wikipedia article, MergeSort seems like a good bet because it's best case is the same as it's worst case scenario.

Realistically, the "best" sorting algorithm really depends on the application. Some might be really fast, but are impractical because of the memory resources they require.

If you're looking for simply two algorithms that have exactly the same speed, check out the table at the wikipedia article. There are several that have the same O speed for best, normal, and worst cases.

Answer 3

Yes, life is divided between two sides, which is the bad and the good.. God and Devil.. It's like math the good side always wins and mathematically is a greater portion of winning at the end than the bad.
The answer is yes and as humans we can not decide whether the decisions we made are good or bad until the end results.
Because sometimes even a step that we take thinking is good it may not be beneficial to us and it turns into a bad decision.

Answer 4

There are many sorting algorithms. There is no BEST one. Which one is optimal depends on your specific data and hardware situation