Binary search
A searching algorithm that uses a file in which the sort key are in ascending order. The middle key in the file is examined and, depending upon whether this is less than or greater than the desired key, the top or bottom part of the file is again examined. Continuing in this way the algorithm either finds the desired record or discovers its absence from the file. Thus the algorithm treats the file is though it were a binary search tree.
Clicking on this step you can see the Video learning step 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! :)
