How to solve this problem
Describe the insertion sort algorithm
Consider the following array of integers:
{11, 21, 9, 20, 39, 1}
Show how the above array can be sorted using insertion sort. Show the elements of the array after each pass of the insertion sort, clearly showing the sorted and unsorted parts of the array.
>> How to solve this problemResearch, study, practice, and understand.Here's a start: http://en.wikipedia.org/wiki/Insertion_sort~
To solve this problem, first understand what insertion sorting is (you may need to google for this). The come up with an algorithm that does exactly what you want, or roughly it. Than break it down bit to bit and convert your algorithm to Java code. Regards.
Jamwaa at 2007-7-12 18:32:11 >
Go away, mukesh.You're just asking others to spoon-feed you stuff that you should have been studying and learning all along. You were either too lazy or too inept to learn your course material when you should have, so deal with the consequences.
jverda at 2007-7-12 18:32:11 >
