4. INSERTION SORT:
• One of the simplest algorithm.
• Requires (n-1) steps…’n’-no. of
elements.
• Data movement takes place
with the help of ’tmp’ and not
by swapping.
8. SHELL SORT:
• Named after Donald shell.
• It compares the elements that are at
distance.
Shell sort is sometimes referred to as
”diminishing increment” sort.
• The sorting number that is chosen
must always be an odd number.
11. MERGE SORT:
• It is a fine example of a recursive
algorithm.
• Makes use of 2 input array that are
sorted among them.
• Almost (n-1) comparisons.
• Divide and conquer strategy.