Insertion sort is a simple sorting algorithm that works by repeatedly inserting elements into a sorted subarray. The algorithm starts at the second element of the array and compares it to the element before it. If the current element is smaller than the element before it, the elements are swapped. This process continues until the entire array is sorted.
Here is an implementation of the insertion sort algorithm in Python:
Python
def insertion_sort(array):
for i in range(1, len(array)):
key = array[i]
j = i - 1
while j >= 0 and array[j] > key:
array[j + 1] = array[j]
j -= 1
array[j + 1] = key
return array
def main():
array = [14, 33, 27, 10, 35, 19, 42, 43]
sorted_array = insertion_sort(array)
print(sorted_array)
if __name__ == "__main__":
main()
Use code with caution. Learn more
This code will sort the given array in ascending order. The output of the code is:
[10, 14, 19, 27, 33, 35, 42, 43]
The insertion sort algorithm is a simple and efficient sorting algorithm. It is not the fastest sorting algorithm, but it is relatively easy to understand and implement.
Here are some of the advantages of the insertion sort algorithm:
It is a simple algorithm to understand and implement.
It is a stable sorting algorithm, which means that the order of equal elements is preserved after sorting.
It is an in-place sorting algorithm, which means that it does not require any additional space to sort the array.
Here are some of the disadvantages of the insertion sort algorithm:
It is not the fastest sorting algorithm.
It is inefficient for large arrays.