Classification: Algorithms can be roughly divided into basic algorithms, data structure algorithms, number theory and algebra algorithms, computational geometry algorithms, graph theory algorithms, dynamic programming and numerical analysis, encryption algorithms, sorting algorithms, retrieval algorithms, randomization algorithms, parallel algorithms, Hermite deformation models and random forest algorithms.
Features: finiteness, that is, the algorithm must be able to terminate after a limited number of steps; Accuracy, each step of the algorithm must have an exact definition; Inputs: An algorithm has 0 or more inputs; Output items; Feasibility, any calculation step in the algorithm can be decomposed into basic executable operation steps, that is, each calculation step can be completed in a limited time.
Extended data
Algorithm history:
"Arithmetic" is the mainland Chinese name of the algorithm from Zhouyi ·suan Jing. The English name Algorithm comes from the 9th century Persian mathematician al-Khwarizmi, who put forward the concept of algorithm in mathematics. "Algorithm", which means the arithmetic of Arabic numerals, evolved into "algorithm" in18th century.
Because Babbage didn't finish his Babbage analyzer, this algorithm can't be executed on Babbage analyzer. Turing, a British mathematician in the 20th century, put forward the famous Turing proposition and an abstract model of an imaginary computer, called Turing Machine. The emergence of Turing machine solved the problem of algorithm definition, and Turing thought played an important role in the development of algorithm.
Baidu Encyclopedia-Algorithm