Selection sort

In computer science, selection sort is 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.

Clicking on this step you can see the Video learningstep of the algorithm.

Video

As a first step you will be able to watch the video representation of the Bubble sort algorithm. This will be presented by hungarian folk dance.


Pay attention and try to understand the main movements of the sorting algorithm, namely the comparison, selection and swap.


This technique involves human movement effect in order to visualize the algorithm in a dinamic way. Enjoy it! :)