Insertion sort
id:
insertion-sort-185-10580230
title:
Insertion sort
text:
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time by comparisons. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages:
- Simple implementation: Jon Bentley shows a version that is three lines in C-like pseudo-code, and five lines when optimized.
- Efficient for (quite) small data sets, much like other quadratic sorting algorithms
brand slug:
wiki
category slug:
encyclopedia
description:
Sorting algorithm
original url:
https://en.wikipedia.org/wiki/Insertion_sort
date created:
2001-10-29T20:10:06Z
date modified:
2024-09-07T18:19:10Z
main entity:
{"identifier":"Q117241","url":"https://www.wikidata.org/entity/Q117241"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/42/Insertion_sort.gif","width":193,"height":302}
fields total:
13
integrity:
16