Algorithm

Algorithm is a sequence of instructions designed to perform specific actions.

The algorithm, written in the machine language, with the help of computer facilities, is used to provide solutions to problems. In math and computer science, this is a clear specification of how to solve a class of tasks. This can perform data processing, calculations, and automated reasoning duties.

Here are some examples:

Search engines - these use special algorithms to collect the information in the internet and display to the user relevant results for a specific query from their search index.

In programming, algorithms are commonly written as functions, which perform as small programs that can be used by a larger entity. For example, an image displaying application may include a library of special functions, each using a custom algorithm to render different file formats. The image editing program can contain algorithms designed to process and edit image data. Examples of such, include resizing, sharpening, cropping, blurring, color enhancement, and red-eye reduction.

There are many ways to perform an operation in a software program. Developers often try to create the most efficient algorithm, by which programmers can ensure that their programs run fast and use minimal system resources.

Of course not all algorithms are perfect for the first time. As a result, programmers improve existing algorithms and incorporate them into future software updates. When you see a new version of an "optimized" or "faster performance" software program, it means the new version includes more polished algorithms.

Different definitions of an algorithm contain the following series of general requirements:

• Discreteness - an algorithm should represent the problem solving process as the sequential execution of some simple steps. At the same time, its each step requires a finite length of time.
• Determinateness. At each moment of time the next step of the work is uniquely determined by the state of the system.
• Clearness - an algorithm should include only those commands that are accessible to the executor and are included in its command system.
• Completeness - in the narrower sense of an algorithm as a mathematical function, with properly specified initial data, the algorithm must complete the work and produce the result in a certain number of steps.
• Massiveness (universality) - an algorithm should be applicable to different sets of initial data.
• Effectiveness - completion of an algorithm by certain results.