Selection Sort Algorithm Tutorial | Beginner Java
Selection sort can be described as: a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.
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. 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.
(https://en.wikipedia.org/wiki/Selecti...)
Video source used:
Selection Sort Video by Timo Burgman
• Selection Sort
На этой странице сайта вы можете посмотреть видео онлайн Selection Sort Algorithm Tutorial | Beginner Java длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Megawatt Apps 08 Июнь 2017, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 591 раз и оно понравилось 5 зрителям. Приятного просмотра!
