From 3598db798cddc0f9c4ebdfb235b849f0108ba6be Mon Sep 17 00:00:00 2001 From: Nicholas Zingleman Date: Wed, 18 Sep 2024 05:48:39 -0400 Subject: [PATCH] Update 104-selection-sort.md (#7147) Dollar Signs were being rendered on the website. Removed for visual clarity. --- .../content/105-sorting-algorithms/104-selection-sort.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/104-selection-sort.md b/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/104-selection-sort.md index 3964740cd..2727c30ad 100644 --- a/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/104-selection-sort.md +++ b/src/data/roadmaps/datastructures-and-algorithms/content/105-sorting-algorithms/104-selection-sort.md @@ -1,3 +1,3 @@ # Selection Sort -Selection Sort is a simple and intuitive sorting algorithm. It works by dividing the array into two parts - sorted and unsorted. Initially, the sorted part is empty and the unsorted part contains all the elements. The algorithm repeatedly selects the smallest (or largest, if sorting in descending order) element from the unsorted part and moves that to the end of the sorted part. The process continues until the unsorted part becomes empty and the sorted part contains all the elements. Selection sort is not efficient on large lists, as its time complexity is $O(n²)$ where $n$ is the number of items. +Selection Sort is a simple and intuitive sorting algorithm. It works by dividing the array into two parts - sorted and unsorted. Initially, the sorted part is empty and the unsorted part contains all the elements. The algorithm repeatedly selects the smallest (or largest, if sorting in descending order) element from the unsorted part and moves that to the end of the sorted part. The process continues until the unsorted part becomes empty and the sorted part contains all the elements. Selection sort is not efficient on large lists, as its time complexity is O(n²) where n is the number of items.