No self-introduction
Loading
Profile
Follow
codes (9)
The realization of complex polygon intersection al
no vote
Any two polygons to draw, you can make the intersection, please, please computation, simple operation, code clarity and understandable.
骑猪逛大街 1 0
1
With a large number of doubly linked lists factori
no vote
With doubly-linked list implementation factorials of large numbers of input a number of unlimited size can be calculated with the factorial of it
骑猪逛大街 0 0
1
Binary search tree implementation calls the
no vote
Binary search tree implementation using the phone's functions such as inserting and deleting modifying
骑猪逛大街 0 0
1
Binary tree Swap left and right subtrees, and quer
no vote
Exchanged in a binary tree node subtree queries about ancestors established by preorder traversal and inorder traversing binary tree
骑猪逛大街 0 0
1
Problem burning of Shu's camps
no vote
Stack data structure fire camp even outcome of the input point coordinates can be output after fire
骑猪逛大街 0 0
1
Depth-first search and breadth-first traversal of
no vote
Depth-first search and breadth-first traversal of the graph input vertex and edge can then be traversed
骑猪逛大街 0 0
1
Infix expressions
no vote
Two stack function evaluating infix expressions input an infix expression can be calculated with the results
骑猪逛大街 0 0
1
VC++ sql2008 school management system
4.0
Attach the database to the sql2008 you can run queries for data from the add remove modify such as cascading deletes
骑猪逛大街 0 0
1
Reads the file in tif format code for histograms a
no vote
Reading images in tif format files can display histograms and thresholding
骑猪逛大街 0 0
1
No more~
Follows0
Fans0