Data-Structures-and-Algorithms
Data Structures and Algorithm Analysis in C.
This repository mainly aims to realize the commonly used data structures and algorithms in C.
In LINKEDLIST, the basic functions of List are realized and solving the "Josephu-Circle" problem by applying Circular-List.
In STACK, the basic functions of stack are realized and applying the stack structure to solve two simple problems:
"Binary,Decimal,Hex and Octal Convert" AND "Brackets Matching".
In TREE, the focus is mainly on the realization of Binary-Search-Tree and the AVL-Tree.
In HASHING, using Separate List/Chain to realize HashTable.
In HEAP, the realization of the basic Binary-Heap(二叉堆) and the Binomial-Heap(二项堆) are included.
In SORTING, about 7 sorting methods are realized including Bubble-sort, Shell-sort, Heap-sort, Quick-sort and so on. The differences among them in the aspects of algorithm and structure are displayed concretely in codes cpp.
In GRAPH, the usage of the Dijkstra algorithm code is illustrated as the picture.
Reference:
Mark, Weiss. Data Structures and Algorithm Analysis in C. Posts & Telecom Press, 2005.
Internet——CSDN-Blog.