# clock-synchronised multiplexers

Posted on Feb 5, 2014

This is the second part of the square root algorithm. It was developed in one month during the final stages of finishing this web site and reviewing this document for publication. While Part I dealt with an empirical discovery for a sequential algorithm to find the square root, and its subsequent mathematical proof, Part II deals with a binary sea

rch variation that greatly improves the root`s calculation speed (even though the sequential search algorithm is the smallest you`ll find, if size is what matters to you). Both algorithms have the same accuracy. NOTES: The "official" address for this document is. Please do not link directly to the address that shows up in your browser - this may be changed without notice. Also note that at the time I write this (August 2000) I am not aware of these algorithms being in use (at least the binary search version), but I cannot confirm this. A binary search works pretty much like searching for a word in a dictionary. When looking for "Green", you don`t open the dictionary in the first page and start looking for your word throughout. Instead you take advantage in the knowledge that the words are ordered alphabetically. Here`s how you would describe the search to someone else: First open the dictionary in half, and look for the first word you find. Compare it to the word you`re looking for. If it`s a match, you found it. Otherwise divide one of the two halves of the dictionary in half again (the right half if the word you`re looking for is after the one you found, the left half if it`s before, alphabetically), and repeat the process. Remember the game "Simon Says" from childhood "Simon Says: Guess the Number". "I`m thinking of a number between 1 and 100 - guess what it is in under 10 attempts". "I can only tell you if your guess is...

Leave Comment

characters left:

• ## New Circuits

.

Popular Circuits

Laser Track Detection