Today found oa credit sweet potato dish platform rental [Source] Contact Forum diguaym.com on GitHub: QQ: 2152876294 a very good project, the current star 4700+, the project mainly about data structures and algorithms, there are 50 languages Code.
There are implementation language c ++, c #, go, java, javascript, object-c, python, scala, swift, as well as the world's best language php.
address:
Involved as follows:
Array
- Implement an array of dynamic expansion of support
- An ordered array to achieve a fixed size, supports dynamic additions and deletions operation
- Achieve two ordered arrays into an ordered array
List
- Single-chain, circular linked list, doubly linked list, add or delete operations support
- Single-chain reversal
- Achieve two ordered lists into one sorted linked list
- Intermediate node seeking to achieve the list
Stack
- Implemented with a sequence of stack array
- Implement a stack using a linked list chain
- Programming analog implementation of a browser forward and backward functions
queue
- A queue order to achieve an array
- A queue is implemented as a linked list chain
- Implement a circular queue
Recursion
- Programming the Fibonacci column evaluation f (n) = f (n-1) + f (n-2)
- Programming factorial n!
- Programming a full set of array data set
Sequence
- Implement merge sort, quick sort, insertion sort, bubble sort, selection sort
- Programming a set of data to find a first element in the large K (n) time complexity O
Binary search
- Achieve an ordered array of binary search algorithm
- Fuzzy binary search algorithm (such as greater than or equal to the predetermined value of the first element)
Hash table
- Hash table to achieve a solution to the conflict based on the law list
- LRU caching algorithm to implement a phase-out
String
- Implement a character set, which contains only a ~ z 26 letters of the Trie
- Achieve simple string matching algorithm
Binary Tree
- Implement a binary search tree, and supports insert, delete, search operations
- Find realize a binary search tree, the successor of a node, the node precursor
- Binary implemented before, during and after the sequence and traverse the layer
stack
- Achieve a small pile top, big top of the heap, priority queues
- Implement heap sort
- The combined use of a priority queue ordered array of K
- Seeking a maximum set of dynamic data set of Top K
Map
- There are achieved, without the representation of FIG entitled FIG adjacency matrix and no right graph adjacency list to FIG.
- Figure implement depth-first search, breadth-first search
- Achieve Dijkstra algorithm, A * algorithm
- Kahn topological sorting algorithm, DFS algorithm
Backtracking
- The use of backtracking algorithm to solve the eight queens problem
- The use of backtracking algorithm to solve 0-1 knapsack problem
Minute Osamu
- Using a divide and conquer algorithm for the set of data on the number of reverse
Dynamic Programming
- 0-1 knapsack problem
- And minimum path
- Programming the shortest Levenshtein edit distance
- Longest common subsequence of two strings to find programming
- Programming a data sequence longest increasing sequence
I looked under C ++ and java to write well, coding style is also very good at learning it, saying simply do not understand the algorithm programmers code farmers.