-
Notifications
You must be signed in to change notification settings - Fork 0
/
InsertionSort.java
36 lines (33 loc) · 1.09 KB
/
InsertionSort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
package com.gkonovalov.algorithms.arrays.sorting;
/**
* Created by Georgiy Konovalov on 17/05/2023.
* <p>
* Insertion Sort is a stable sorting algorithm, ensuring that elements with equal values
* maintain their relative order after sorting.
* Insertion Sort has a time complexity of O(n^2), but it performs fewer
* comparisons and swaps than Selection Sort on average.
* For partially sorted arrays, it can run with complexity O(n).
* However, in general, Insertion Sort is less efficient compared to other
* sorting algorithms like Merge Sort or Quick Sort.
* </p>
* Runtime Complexity: O(n^2).
* Space Complexity: O(1).
*/
public class InsertionSort {
public void sort(int[] arr) {
for (int i = 0; i < arr.length; i++) {
for (int k = i; k > 0; k--) {
if (arr[k - 1] > arr[k]) {
swap(arr, k, k - 1);
} else {
break;
}
}
}
}
private void swap(int[] arr, int a, int b) {
int temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
}
}