opensource/developer-roadmap
3
0
Fork 0
mirror of https://github.com/kamranahmedse/developer-roadmap.git synced 2026-10-25 09:34:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: add insertion sort explanation (#10239)

Browse Source
This commit is contained in:
Roshan Malviya
2026-08-18 09:41:34 +02:00
committed by GitHub
parent 16dea8b101
commit 866f2f2226
1 changed files with 7 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md
+7
View File
@@ -1,5 +1,12 @@
# Insertion Sort
Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. Then, you pick a card from the unsorted group and put it in the right place in the sorted group.
- Start with the second element as the first element is assumed to be sorted.
- Compare the second element with the first if the second is smaller then swap them.
- Move to the third element, compare it with the first two, and put it in its correct position
- Repeat until the entire array is sorted.
Visit the following resources to learn more:
- [@course@Insertion Sort](https://youtu.be/JU767SDMDvA)