Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as …

Broadly, algorithms define process (es), sets of rules, or methodologies that are to be followed in calculations, data processing, data mining, pattern recognition, automated reasoning or other …

Instead of using a specific programming language, the algorithms are written in pseudocode. The descriptions focus on the aspects of the algorithm itself, its mathematical properties, and emphasize …

Asymptotically optimal algorithms have been known since the mid-20th century – new algorithms are still being invented, with the widely used Timsort dating to 2002, and the library sort being first published …

Pages in this category should be moved to subcategories where applicable. This category may require frequent maintenance to avoid becoming too large. It should directly contain very few, if any, pages …

Timeline of algorithms The following timeline of algorithms outlines the development of algorithms (mainly "mathematical recipes") since their inception.

In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms —the amount of time, storage, or other resources needed to execute them.