-
1. Selection sort - Wikipedia
Link: https://en.wikipedia.org/wiki/Selection_sort
Description: WebIn computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n 2) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort.
-
2. Selection Sort – Data Structure and Algorithm Tutorials
Link: https://www.geeksforgeeks.org/selection-sort/
Description: WebApr 17, 2024 · Selection Sort – Data Structure and Algorithm Tutorials. Last Updated : 17 Apr, 2024. Selection sort is a simple and efficient sorting algorithm that works by repeatedly selecting the smallest (or largest) element from the unsorted portion of the list and moving it to the sorted portion of the list. The algorithm repeatedly selects the ...
-
3. Selection Sort (With Code in Python/C++/Java/C) - Programiz
Link: https://www.programiz.com/dsa/selection-sort
Description: WebSelection sort is a sorting algorithm that selects the smallest element from an unsorted list in each iteration and places that element at the beginning of the unsorted list. Working of Selection Sort. Set the first element as minimum . Select first element as minimum. Compare minimum with the second element.
-
4. Analysis of selection sort (article) | Khan Academy
Link: https://www.khanacademy.org/computing/computer-science/algorithms/sorting-algorithms/a/analysis-of-selection-sort
Description: WebSelection sort shares many of the benefits that insertion sort has, which is also O(n^2): - It performs well on small inputs. (If n is small it will beat O(n log n) sorts ) - It requires only constant extra space (unlike merge sort) It also has some extra benefits: - It's very simple. So, it is easy to program.
-
5. Selection Sort Algorithm - Online Tutorials Library
Link: https://www.tutorialspoint.com/data_structures_algorithms/selection_sort_algorithm.htm
Description: Webdef insertion_sort(array, size): for i in range(size): imin = i for j in range(i+1, size): if arr[j] < arr[imin]: imin = j temp = array[i]; array[i] = array[imin]; array[imin] = temp; arr = [12, 19, 55, 2, 16] n = len(arr) print("Array before Sorting: ") print(arr) insertion_sort(arr, n); print("Array after Sorting: ") print(arr)
-
6. Selection Sort Tutorials & Notes | Algorithms | HackerEarth
Link: https://www.hackerearth.com/practice/algorithms/sorting/selection-sort/tutorial/
Description: WebTutorial. Visualizer BETA. The Selection sort algorithm is based on the idea of finding the minimum or maximum element in an unsorted array and then putting it in its correct position in a sorted array. Assume that the array A = [ 7, 5, 4, 2] needs to be sorted in ascending order.
-
7. Sorting (article) | Selection sort | Khan Academy
Link: https://www.khanacademy.org/computing/computer-science/algorithms/sorting-algorithms/a/sorting
Description: WebGoogle Classroom. Sorting a list of items into ascending or descending order can help either a human or a computer find items on that list quickly, perhaps using an algorithm like binary search. JavaScript has a built-in sorting method. It works on arrays of numbers, or even on arrays of strings:
-
8. Selection Sort – Algorithm, Source Code, Time Complexity
Link: https://www.happycoders.eu/algorithms/selection-sort/
Description: WebJun 25, 2020 · describes how Selection Sort works, includes the Java source code for Selection Sort, shows how to derive its time complexity (without complicated math) and checks whether the performance of the Java implementation matches the expected runtime behavior. You can find the source code for the entire article series in my GitHub repository.
-
9. DSA Selection Sort - W3Schools
Link: https://www.w3schools.com/dsa/dsa_algo_selectionsort.php
Description: WebSelection Sort. The Selection Sort algorithm finds the lowest value in an array and moves it to the front of the array. Speed: { { buttonText }} { { msgDone }} The algorithm looks through the array again and again, moving the next lowest values to the front, until the array is sorted. How it works: Go through the array to find the lowest value.
-
10. General | Algorithm | Selection-Sort Algorithm | Codecademy
Link: https://www.codecademy.com/resources/docs/general/algorithm/selection-sort
Description: WebJul 13, 2023 · Selection sort is a sorting algorithm that repeatedly finds the minimum element in the unsorted portion of an array and swaps it with the element at the beginning of the unsorted section. This process continues until the entire array is sorted. The algorithm has a time complexity of O (n^2), where n is the number of elements in the array.
