Hi,
I have read in the book about insertion sort that:
The algorithm for Insertion sort is:
Some body please guide me with this comparison problem.
Zulfi.
I have read in the book about insertion sort that:
I cant understand the above statement. I have attached an example & by looking at that i cant understand how we have L/2 comparisonsLet us look at the amount of work that is required to insert the last element into its proper place. If the list length is L, we expect about L/2 comparisons & L/2 assignments
The algorithm for Insertion sort is:
Some body please guide me with this comparison problem.
Zulfi.
Attachments

2.6 MB Views: 4