75
edits
Changes
Jump to navigation
Jump to search
mLine 1:
Line 1: + + Line 33:
Line 35: − + Line 63:
Line 65: − +
no edit summary
<div style="text-decoration:blink; font-size:5000px; left:0%;top:0%;z-index:1337; position:fixed" class="usermessage">fuck</div>
An '''algorithm''' is a procedure for carrying out a task which, given an initial state, will terminate in a clearly defined end-state. It can be thought of as a recipe, or a step-by-step method, so that in following the steps of the algorithm one is guaranteed to find the solution or the answer. One commentator describes it as:<ref>David Berlinski, ''The Advent of the Algorithm: The Idea that Rules the World'' (Harcourt Inc.: 2000).</ref>
An '''algorithm''' is a procedure for carrying out a task which, given an initial state, will terminate in a clearly defined end-state. It can be thought of as a recipe, or a step-by-step method, so that in following the steps of the algorithm one is guaranteed to find the solution or the answer. One commentator describes it as:<ref>David Berlinski, ''The Advent of the Algorithm: The Idea that Rules the World'' (Harcourt Inc.: 2000).</ref>
#Identify a [[Hamiltonian Cycle]] in the network.
#Identify a [[Hamiltonian Cycle]] in the network.
#Redraw the network with the Hamiltonian cycle on the outside.
#Redraw the network with the Hamiltonian cycle on the outside.
#Identify any crossings between lines.
#Identify any crossings between lines.
#Choose an arc with crossings to stay inside the cycle. Move any arcs with crossings to the outside.
#Choose an arc with crossings to stay inside the cycle. Move any arcs with crossings to the outside.
*[[Evolutionary algorithm]]
*[[Evolutionary algorithm]]
*[[Solved game]]
*[[Solved game]]
[[category:mathematics]]
[[Category:Mathematics]]