Algorithms Lesson 2: Insertion Sort

http://xoax.net/

For this lesson, we explain and demonstrate graphically how to perform the insertion sort algorithm. For C++ insertion sort code, go to our lesson page at xoax.net.

Please submit all questions to our forum:
http://xoax.net/forum/

Category:

Science & Technology

Tags:

• computer
• programming
• science
• algorithm
• insertion
• sort
• code
• beginner
• illustration
• animation
• time

[axeld93]

@myjunno Because in languages like C, arrays are indexed from 0 up, not 1 up. So the last element is indexed n-1, not n. If you used n, you would be accessing elements not in the array.

[fuzwire]

@Astrosisphere it may be better but that so called idiot is also trying there to teach you and you should appreciate his efforts as well

[Listn2CKY]

I like the music :). Very relaxing and helps learning.

[DivjotBogas]

The animation helps so much!! It clears the idea so well , i bet in my exam i would be seeing a brown background with white spots dancing :P

[rtcvb32]

Perhaps it may modify the actual algorithm's second half (but not how it works), I would recommend a brief explanation of the binary search and how that works. Then using the already sorted elements to find where to insert the number in question. Although in it's simplicity, there's nothing wrong with the explanation.

[LibelCase]

it helps me a lot! thanks man!

[TheRAVIKELAKAM]

good !

[316lga]

this concl-

[axeld93]

@fahadkhan2 Pseudocode is intended to be read by humans, and is not in any particular programming language. Hence the pseudocode is indexed from 1 up, since that is how humans count.

[rampage241]

blew my mind!

[rhlkiller420]

awesome!!



[fahadkhan2]

@axeld93 : Then why does the indexing in the pseudocode mention starts from 1 not 0?