Update arrays-insertionsort.md

docs/arrays/arrays-insertionsort.md

@@ -95,9 +95,7 @@ Consider an array `arr = [12, 11, 13, 5, 6]` that we want to sort in ascending o
 
 You can visualize the Insertion Sort algorithm using the following animation:
 
-<div style={{padding: "10px 50px"}}>
-    <InsertionSortVisualization />
-</div>
+  <InsertionSortVisualization />
 
 You can select the Insertion Sort algorithm from the drop-down menu and visualize how it works on different arrays.
 
@@ -165,4 +163,4 @@ The space complexity of the Insertion Sort algorithm is ***O(1)*** since it requ
 - [Khan Academy - Insertion Sort](https://www.khanacademy.org/computing/computer-science/algorithms/insertion-sort/a/insertion-sort)
 - [TutorialsPoint - Insertion Sort](https://www.tutorialspoint.com/data_structures_algorithms/insertion_sort_algorithm.htm)
 - [StudyTonight - Insertion Sort](https://www.studytonight.com/data-structures/insertion-sorting)
-- [Insertion Sort Visualization](https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html)
+- [Insertion Sort Visualization](https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html)