From a2dc9aa3ab8b4d62c991ea97868c83f5ecc5ebe5 Mon Sep 17 00:00:00 2001 From: amirhossein allami Date: Tue, 10 Sep 2024 17:41:24 +0330 Subject: [PATCH] Add Algorithm GIF --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index a00d9a1..87fc40d 100644 --- a/README.md +++ b/README.md @@ -34,6 +34,8 @@ 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) + ### Advantages - Simple to understand and implement - Performs well on small lists