https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%983%EC%A3%BC%EC%88%99%EC%A0%9C 2026-05-15T10:24:21Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%983%EC%A3%BC%EC%88%99%EC%A0%9C&diff=63303&oldid=prev 2021-02-07T05:30:20Z

<p></p> <p><b>New page</b></p><div>= Examples =<br /> from [http://www.csc.liv.ac.uk/~ped/teachadmin/algor/d_and_c.html The university of liverpool of Computer Science Department]<br /> == BinarySearch ==<br /> Consider the following problem: one has a directory containing a set of names and a telephone number associated with each name.<br /> <br /> The directory is sorted by alphabetical order of names. It contains n entries which are stored in 2 arrays:<br /> <br /> names (1..n) ; numbers (1..n)<br /> <br /> Given a name and the value n the problem is to find the number associated with the name. <br /> <br /> == Closest Set ==<br /> Input:<br /> <br /> P = {p(1), p(2) ,..., p(n) }<br /> <br /> where p(i) = ( x(i), y(i) ).<br /> <br /> A set of n points in the plane.<br /> <br /> Output<br /> <br /> The distance between the two points that are closest.<br /> <br /> Note: The distance DELTA( i, j ) between p(i) and p(j) is defined by the expression:<br /> <br /> Square root of { (x(i)-x(j))^2 + (y(i)-y(j))^2 }<br /> <br /> == Integer Multiplication ==<br /> [http://www.csc.liv.ac.uk/~ped/teachadmin/algor/pic4.gif]<br /> The (2n)-digit decimal representation of the product x*y = z<br /> Note: The algorithm below works for any number base, e.g. binary, decimal, hexadecimal, etc. We use decimal simply for convenience. <br /> <br /> = Exercises =<br /> from [http://pages.cpsc.ucalgary.ca/~jacobs/Courses/cpsc413/W05/ University of Calgary Dept.CS]<br /> [http://pages.cpsc.ucalgary.ca/~jacobs/Courses/cpsc413/W05/labs/DivideConquer.pdf Divide and conquer lab exercises]</div>

imported>Unknown