Home SourceCode
Mathimatics-Numerical algorithms
Data structs
Data structs list
Sort by ：
-
The main achievement is to create two branches tree, and use the first and middle traversal to traverse the two fork tree.
Update : 2025-04-17 Size : 1kb Publisher : 晴栀菀歌° -
The main achievement is to create a Huffman tree and output Huffman coding for each node.
Update : 2025-04-17 Size : 1kb Publisher : 晴栀菀歌° -
Topological sort A topological sort for a Directed Acyclic Graph (DAG) G is a linear sequence of all vertices in G, which makes any pair of vertices u and V in the graph, and if the edge (U, V) E (G) appears in the linea
Update : 2025-04-17 Size : 2kb Publisher : 晴栀菀歌° -
Hill sorting (Shell Sort) is a sort of insertion sort. Also known as narrowing incremental sort, is a more efficient version of the direct insertion sort algorithm. The Hill sort is an unstable sorting algorithm. The met
Update : 2025-04-17 Size : 1kb Publisher : 晴栀菀歌° -
Heap sorting in data structures, building the largest (smallest) heap
Update : 2025-04-17 Size : 1kb Publisher : yyuan -
A variety of sorting algorithms related to data structure
Update : 2025-04-17 Size : 209kb Publisher : 我就是问问 -
The stack of array implementation
Update : 2025-04-17 Size : 78kb Publisher : numpy -
Solving Joseph problem by chain type
Update : 2025-04-17 Size : 491kb Publisher : bjut_Allen -
Algorithm Merge in language C
Update : 2025-04-17 Size : 11kb Publisher : marcoaoc -
Source code of Tree implementation
Update : 2025-04-17 Size : 27kb Publisher : marcoaoc -
abcdefghigklmnopqrstuvwxyz
Update : 2025-04-17 Size : 1kb Publisher : 鱼可爱 -
This method is based on the probability of character appearance to construct the shortest mean length of the head, sometimes called the best encoding, which is generally called the Huffman code.
Update : 2025-04-17 Size : 1kb Publisher : PLEASE