Comments on: Sorting Algorithms http://betterexplained.com/articles/sorting-algorithms/ Learning shouldn't hurt. Let's share the insights that made difficult ideas click. Fri, 5 Dec 2008 07:23:32 +0000 http://wordpress.org/?v=2.0 by: Loss of hair http://betterexplained.com/articles/sorting-algorithms/#comment-208302 Sun, 12 Oct 2008 00:18:02 +0000 http://betterexplained.com/articles/sorting-algorithms/#comment-208302 <strong>You are loosing your hair...</strong> You are loosing your hair by the minute! Stop the Loss of hair... You are loosing your hair…

You are loosing your hair by the minute! Stop the Loss of hair…

]]> by: Samoel Beheshti http://betterexplained.com/articles/sorting-algorithms/#comment-87803 Sat, 17 Nov 2007 02:44:31 +0000 http://betterexplained.com/articles/sorting-algorithms/#comment-87803 yes ,I agree with Insertion sort!! I think when movements of the Elements in an Array are expensive or when the comparison of the Keys are cheap ,, we can also use Selection Sort "! I think that Radix Sort should(CAN) be a good choice for Linear Sorting . pls.correct if I am wrong! yes ,I agree with Insertion sort!!

I think when movements of the Elements in an Array are expensive or when the comparison of the Keys are
cheap ,, we can also use Selection Sort “!

I think that Radix Sort should(CAN) be a good choice for Linear Sorting .

pls.correct if I am wrong!

]]> by: Sagar Mehta http://betterexplained.com/articles/sorting-algorithms/#comment-61522 Tue, 02 Oct 2007 07:28:29 +0000 http://betterexplained.com/articles/sorting-algorithms/#comment-61522 Insertion sort works really well when the input is sorted or near sorted [linear time ] while quick sort is worst in such as case performing at O(n^2) ... Anyone more knowledgeable correct me if I'm wrong :) Insertion sort works really well when the input is sorted or near sorted [linear time ] while quick sort is worst in such as case performing at O(n^2) …

Anyone more knowledgeable correct me if I’m wrong :)

]]>