Insertion Sort: Difference between revisions
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
Insertion sort receives an array of integers and sorts the values [[Sorting_Algorithms#In-place|in-place]]. It works as follows: we start from the left side of the array, and for each key, we insert it in the ''correct'' position in the already sorted sub-array that grows from left to right. The insertion is performed by scanning the sub-array from right to left in a while loop and swapping the elements until we reach the correct position of the key being handled. | Insertion sort receives an array of integers and sorts the values [[Sorting_Algorithms#In-place|in-place]]. It works as follows: we start from the left side of the array, and for each key, we insert it in the ''correct'' position in the already sorted sub-array that grows from left to right. The insertion is performed by scanning the sub-array from right to left in a while loop and swapping the elements until we reach the correct position of the key being handled. | ||
<syntaxhighlight lang='java'> | |||
public static void insertionSort(int[] a) { | |||
} | |||
<syntaxhighlight> | |||
Revision as of 20:23, 5 August 2018
Internal
Overview
Insertion sort receives an array of integers and sorts the values in-place. It works as follows: we start from the left side of the array, and for each key, we insert it in the correct position in the already sorted sub-array that grows from left to right. The insertion is performed by scanning the sub-array from right to left in a while loop and swapping the elements until we reach the correct position of the key being handled.
<syntaxhighlight lang='java'> public static void insertionSort(int[] a) { } <syntaxhighlight>