The binary accounting system might be a great mystery to those who are not well acquainted with the field of mathematics (either because you don't like it, or because you simply cannot understand so many mysteries). In this little article, you are going to learn a few things about the binary search algorithm that computers use. However, if you are rather interested in converting numbers, you can choose an online calculator that automatically converts decimal to binary or vice versa.
 |
| How the Binary Algorithm Works in a Search System |
If you need to work converting binary to decimal, there are also many converters that help you do that online for free. Now back to our short lesson on binary search algorithms. How do they work? Well, the binary search helps find quickly the right answer to a problem, especially if there is available a sorted list of numbers, or answers that the system can choose from. In other words, the binary system helps finding the quickest and most correct solution to a problem because:
* The algorithm can quickly locate the position of an element in a list
* When the search parameters are given, the system starts its search- it basically starts in the middle of the list and will perform a check to see if the value it is searching for is higher or lower. For example, if the search parameter is 75, and the list has 100 entries, the algorithm starts at 50 (in the middle of the list). Now, it will quickly recognize that the value it is looking for is actually higher than 50. What it will do, is to eliminate from the search entries from 0 to 50, and start searching the list from entries 50 to 100. Of course, it will much quicker find the parameter this way, than if it would search the entire list with 100 entries one by one (linear search).
This is only a very simple representation of how the binary search algorithm works. Imagine that it can find the same accurately parameters on a list containing 1,000,000 items. To search for an exact number in such a huge list using the traditional linear search, it would take at least half a million comparisons for the system in order to spot the correct answer. But thanks to the algorithm system, everything is based on a non-linear search, based on the "elimination" system (this way, it will use only around 20 comparisons until it spots the correct parameter).
For further decimal and binary correlations, you should try out a decimal to binary calculator which is free, and will help you convert quickly the numbers.
* The algorithm can quickly locate the position of an element in a list
* When the search parameters are given, the system starts its search- it basically starts in the middle of the list and will perform a check to see if the value it is searching for is higher or lower. For example, if the search parameter is 75, and the list has 100 entries, the algorithm starts at 50 (in the middle of the list). Now, it will quickly recognize that the value it is looking for is actually higher than 50. What it will do, is to eliminate from the search entries from 0 to 50, and start searching the list from entries 50 to 100. Of course, it will much quicker find the parameter this way, than if it would search the entire list with 100 entries one by one (linear search).
This is only a very simple representation of how the binary search algorithm works. Imagine that it can find the same accurately parameters on a list containing 1,000,000 items. To search for an exact number in such a huge list using the traditional linear search, it would take at least half a million comparisons for the system in order to spot the correct answer. But thanks to the algorithm system, everything is based on a non-linear search, based on the "elimination" system (this way, it will use only around 20 comparisons until it spots the correct parameter).
For further decimal and binary correlations, you should try out a decimal to binary calculator which is free, and will help you convert quickly the numbers.
0 comments:
Post a Comment