Linear search

In computer science, linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched. Linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list. If each element is equally likely to be searched, then linear search has an average case of n/2 comparisons, but the average case can be affected if the search probabilities for each element vary. Linear search is rarely practical because other search algorithms and schemes, such as the binary search algorithm and hash tables, allow significantly faster searching for all but short lists.

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! :)