Tinky2013的博客

Code Implementation of Link list1 Construction of link list1.1 Construct a link listtypedef struct Link{ char elem; // Represents the data field struct Link * next; // Represents the p...

Data Structure: Code Implementation of Sequential table1 Construction of the sequential table1.1 Construct a sequential tableIn order to facilitate the later use of the data in the table, the seque...

Data Structure：Matrix Compression Storage1 IntroductionIn data structures, a compressed storage structure for some specific matrices is provided.The special matrix we mentioned can be generally di...

Data Structure：Pattern Matching Algorithm of String1 Brute Force Algorithm (BF)1.1 IntroductionPattern matching means judging whether two strings has a Common Component, there’re two ways to achie...

Data Structure: The traverse and storage of Binary Tree1 Chain Storage of Binary TreeUsually, we use link list to store a binary tree, the structure could be seen as follow:We can see that the no...

Data Structure: The Storage of String1 IntroductionIf we want to store a string, there will be 3 storage structure contained:Fixed length sequential storage: Static array, the same as ordinary ar...

Data Structure：Basic operations and Applications of Queue1 Basic knowledge1.1 IntroductionThe queue is a commonly used data structure that has special features, different from stack, the queue ope...

Data Structure: Basic operations of Stack1 Basic knowledge1.1 IntroductionSimilar to sequential table or link list, stack is another kind of linear storage structure. Stack is special due to its u...

Code Implementation of Double Circular Link list1 Construction1.1 Construct the link listtypedef struct line{ struct line * prior; int data; struct line * next;}line;Double circular...

Code Implementation of Double link list1 Construction of a double link list1.1 Construct the nodetypedef struct line{ struct line * prior; // Point to the precursor int data; struct li...

Code Implementation and Application of Circular link list1 Construction1.1 BackgroundThe Joseph ring problem: Given n persons (Numbers 1,2,3, … , n) sit around a round table and count clockwise fr...

Code Implementation of Static link list1 Construction of the static link list1.1 Construct a static link listStatic link list is different from the link list discussed in the last passage(We call t...

Data Structure: Generalize list1 Storage structure of generalize list1.1 An exampleThe generalize list can store item itself (we call atom) and sublist, so the basic node of generalize list have t...