Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- In this video tutorial we understand the working of selection sort algorithm in data structures.
Selection Sort -
1. Selection sort is a sorting algorithm, specifically an in-place comparison sort.
2. It has O(n^2) time complexity, making it inefficient on large lists.
3. The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list.
4. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
Full DSA playlist - [ Ссылка ]
Full Code & Theory article - [ Ссылка ]
C++ Programming Tutorials for Beginners Course - [ Ссылка ]
Simple Snippets Official Website -
[ Ссылка ]
Simple Snippets on Facebook -
[ Ссылка ]
Simple Snippets on Instagram -
[ Ссылка ]
Simple Snippets on Twitter -
[ Ссылка ]
Simple Snippets Google Plus Page -
[ Ссылка ]
Simple Snippets email ID -
simplesnippetsinfo@gmail.com
For More Technology News, Latest Updates and Blog articles visit our Official Website - [ Ссылка ]
#selectionsort #sortingalgorithms #datastructures #algorithms
