From f6d5331dfc8f842518d6dba091dfa4b1b5d06583 Mon Sep 17 00:00:00 2001
From: amirhossein allami <amirallami.dev@gmail.com>
Date: Wed, 11 Sep 2024 15:05:03 +0330
Subject: [PATCH] Update README.md

---
 README.md | 9 +++++++--
 1 file changed, 7 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index f8f0dd2..397adcf 100644
--- a/README.md
+++ b/README.md
@@ -34,8 +34,13 @@ Selection Sort is an in-place comparison-based algorithm that divides the input
 
 The algorithm repeatedly selects the smallest (or largest) element from the unsorted portion and moves it to the end of the sorted portion.
 
-![Selection Sorting Algorithm](assets/algorithm-animation.gif)
-[GIF Reference](https://youtu.be/kPRA0W1kECg?si=VhbgKEH0BB6uqjTQ)
+<p align="center">
+  <img width="750" height="auto" src="assets/algorithm-animation.gif">
+</p>
+
+<div align="center">
+      <a href="https://youtu.be/kPRA0W1kECg?si=VhbgKEH0BB6uqjTQ">GIF Reference</a>
+</div>
 
 ### Advantages
 - Simple to understand and implement