From f55087f39219ffdd352b1ed4da0f482273d406f9 Mon Sep 17 00:00:00 2001 From: Esther Ibeh Date: Tue, 25 Nov 2025 09:52:14 +0100 Subject: [PATCH] Add course link for Insertion Sort (#9279) Added a link to an Insertion Sort course for better understanding. --- .../content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md | 1 + 1 file changed, 1 insertion(+) diff --git a/src/data/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md b/src/data/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md index c7cba5a2f..7affe2fb1 100644 --- a/src/data/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md +++ b/src/data/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md @@ -3,3 +3,4 @@ Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It's much less efficient on large lists than more advanced algorithms like quicksort, heapsort, or merge sort. Still, it provides several advantages such as it's easy to understand the algorithm, it performs well with small lists or lists that are already partially sorted and it can sort the list as it receives it. The algorithm iterates, consuming one input element each repetition and growing a sorted output list. At each iteration, it removes one element from the input data, finds the location it belongs within the sorted list and inserts it there. It repeats until no input elements remain. - [@article@Insertion Sort Visualization](https://www.hackerearth.com/practice/algorithms/sorting/insertion-sort/visualize/) +- [@course@Insertion Sort](https://youtu.be/JU767SDMDvA?si=oOobPivq5t440PpF)