Introduction - If you have any usage issues, please Google them yourself
Insertion algorithm, merging algorithm, heap sort, quick sort, polynomial addition and subtraction (with the chain to achieve), decimal converted to binary (+ stack implementation with the team), open the address method (linear probing), a detection method (square detection ), Secondary detection method (two-HASH) quick search, use binary sort tree to sort and find and delete a node, to achieve breadth or depth-first sorting algorithm, algorithm or Prime Kruskal algorithm to achieve.