Algorithms
According to Dr Panos Parpas, a lecturer in the quantitative analysis and decision science (“quads”) section of the department of computing at Imperial College London, says that wherever we use computers, we rely on algorithms: “There are lots of types, but algorithms, explained simply, follow a series of instructions to solve a problem. It’s a bit like how a recipe helps you to bake a cake. Instead of having generic flour or a generic oven temperature, the algorithm will try a range of variations to produce the best cake possible from the options and permutations available.”
Get Riyashi Chandak’s stories in your inbox
Join Medium for free to get updates from this writer.
According to the popular algorithms textbook Introduction to Algorithms (Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein),
An algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values as output.
The scientists required an algorithm that would allow them to figure out the problem in an orderly, numerical and precise manner, resulting in a conclusive answer. Every time you run a computer program, the program runs an algorithm of codes, which results in functions being operated at certain orders based on conditions written in such code. To solve a Rubik’s cube you must learn various algorithms that move a specific block but returns to its starting position after a certain number of turns.
So, you can simply say algorithms are nothing but preplanned flow of steps that are to be followed to get the task done. Once we are able to device an algorithm the aftermath is quite simple. This makes computing simple and aids us.
(Image credit to the owner.)







