We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 5c4e58d + f6d5331 commit 38e2fd3Copy full SHA for 38e2fd3
README.md
@@ -34,8 +34,13 @@ Selection Sort is an in-place comparison-based algorithm that divides the input
34
35
The algorithm repeatedly selects the smallest (or largest) element from the unsorted portion and moves it to the end of the sorted portion.
36
37
-
38
-[GIF Reference](https://youtu.be/kPRA0W1kECg?si=VhbgKEH0BB6uqjTQ)
+<p align="center">
+ <img width="750" height="auto" src="assets/algorithm-animation.gif">
39
+</p>
40
+
41
+<div align="center">
42
+ <a href="https://youtu.be/kPRA0W1kECg?si=VhbgKEH0BB6uqjTQ">GIF Reference</a>
43
+</div>
44
45
### Advantages
46
- Simple to understand and implement
0 commit comments