|insertion sort||computing dictionary|
A sorting algorithm that inserts each item in the proper place into an initially empty list by comparing it with each item in the list until it finds the new element's successor or the end of the list.
Compare: bubble sort.
(01 Mar 1997)
|Bookmark with:||word visualiser||Go and visit our forums|