From 2378cd4bb96e56f2e05661d2f851498aaa2178e2 Mon Sep 17 00:00:00 2001
From: Francesco Mannino <61598026+manninofrancesco@users.noreply.github.com>
Date: Tue, 1 Oct 2024 10:54:22 +0200
Subject: [PATCH] [typo]: Update 102-insertion-sort.md (#7281)

---
 .../content/105-sorting-algorithms/102-insertion-sort.md        | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/102-insertion-sort.md b/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/102-insertion-sort.md
index 46494583e..511922887 100644
--- a/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/102-insertion-sort.md
+++ b/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/102-insertion-sort.md
@@ -3,4 +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 - W3Schools](https://www.w3schools.com/dsa/dsa_algo_insertionsort.php)
-- [@article@Insertion Sort Visulation](https://www.hackerearth.com/practice/algorithms/sorting/insertion-sort/visualize/)
+- [@article@Insertion Sort Visualization](https://www.hackerearth.com/practice/algorithms/sorting/insertion-sort/visualize/)