Skip to content
삽입 정렬

File:Insertion_sort.gif · Wikimedia Commons · See Wikimedia Commons

EntityQ117241· pop 46· linked from 89 articles

삽입 정렬

Sign in to save

각 반복에서 현재 입력 요소를 이미 정렬된 요소 사이의 적절한 위치에 삽입하는 정렬 알고리즘

In the Vinony graph

Vinony's link graph records 89 inbound references to 삽입 정렬, and connects out to sorting algorithm, merge sort and heapsort.

It sits within the topics Comparison sorts, Online sorts and Stable sorts.

Vinony links it to 40 Wikipedia language editions.

Key facts

Class
Sorting algorithm
Data structure
Array
Worst case performance
O ( n 2 ) {\displaystyle O(n^{2})} comparisons and swaps
Best case performance
O ( n ) {\displaystyle O(n)} comparisons, O ( 1 ) {\displaystyle O(1)} swaps
Average performance
O ( n 2 ) {\displaystyle O(n^{2})} comparisons and swaps
Worst case space complexity
O ( n ) {\displaystyle O(n)} total, O ( 1 ) {\displaystyle O(1)} auxiliary
Optimal
No

via Wikipedia infobox

Wikidata facts

Image
Insertion sort.gif
Show 3 more facts
Commons category
Insertion sort
name in kana
インサーションソート
Sources (2)

via Wikidata · CC0

Gallery (4)

Connections

Categories