-
Course Introduction -
Course outline
Chapter 1 Contents and Introduction (27 minutes Section 2) 1-1 catalog Main content: mainly introduce the content to be explained in the data structure course, as well as the matters needing attention in the learning process, as well as the course chapter arrangement and introduction Click "Only for paying users" to download "data structure source code. rar" [11:22] Start learning 1-2 introduction Main contents: concept of data structure, classification of data structure, concept of ADT type, basic concept of algorithm, indicators to measure the quality of algorithm (time complexity, space complexity) [16:02] Start learning Chapter 2 Linear table (9 hours 19) 2-1 Sequence table implementation of linear table_1 Main content: framework construction of sequence table programming [24:06] Start learning 2-2 Sequence table implementation of linear table_2 Main content: implementation of sequence table method& nbsp; [1]push_back [2]push_fornt [3]show_list [4]pop_back & nbsp; [5]pop_front [6]insert_pos [7]find & nbsp; [8]lenght [49:24] Start learning 2-3 Sequence table implementation of linear table_3 Main content: implementation of sequence table method& nbsp; [9]delete_pos [10]delete_val [11]sort & nbsp; [12]resver [13] clear [14*]destroy [33:20] Start learning 2-4 Implementation of sequence table of linear table_4 Main content: Incremental configuration of sequence table and implementation of merge function [30:39] Start learning 2-5 Single linked list implementation of linear table_1 Main contents: concept and understanding of linked list, creation of single linked list, role of head node [48:37] Start learning 2-6 Single linked list realization of linear table_2 Main content: management mode of single linked list, creation of implementation framework of single linked list [17:45] Start learning 2-7 Single linked list implementation of linear table_3 Main content: menu method implementation of single linked list& nbsp; [1] push_back [2] push_front [3] show_list [4] pop_back & nbsp; [5] pop_front [6] insert_val [7] find & nbsp; [8] length [52:02] Start learning 2-8 Single linked list realization of linear table_4 Main content: menu method implementation of single linked list& nbsp; [9] delete_val [10] sort [11] resver & nbsp; [12] clear [13*] destroy [34:05] Start learning 2-9 Single linked list realization of linear table_5 Main content: improvement of single linked list method, mainly introducing the simple idea of iterator and introducing _buynode function to simplify the code [11:36] Start learning 2-10 Realization of Static Linked List of Linear List Main content: concept of static linked list, representation and implementation, completion of initialization function, insertion function, deletion function [40:17] Start learning 2-11 Realization of single cycle linked list of linear list _1 Main content: concept and understanding of single cycle linked list, framework construction [12:54] Start learning 2-12 Realization of single cycle linked list of linear list _2 Main content: menu method implementation of single circular linked list& nbsp; [1] push_back [2] push_front [3] show_list [4] pop_back & nbsp; [5] pop_front [6] insert_val [7] find & nbsp; [8] length [29:02] Start learning 2-13 Realization of single cycle linked list of linear list 3 Main content: menu method implementation of single circular linked list& nbsp; [9] delete_val [10] sort [11] resver & nbsp; [12] clear [13*] destroy [22:22] Start learning 2-14 Double linked list implementation of linear list _1 Main contents: concept and understanding of double linked list, framework construction [12:50] Start learning 2-15 Double linked list realization of linear list _2 Main content: menu method implementation of double linked list& nbsp; [1] push_back [2] push_front [3] show_list [4] pop_back & nbsp; [5] pop_front [6] insert_val [7] find & nbsp; [8] length [34:08] Start learning 2-16 Double linked list realization of linear list _3 Main content: menu method implementation of double linked list& nbsp; [9] delete_val [10] sort [11] resver & nbsp; [12] clear [13*] destroy [20:46] Start learning 2-17 Realization of bi-directional circular linked list of linear table_1 Main content: concept and understanding of two-way circular linked list, framework construction [15:18] Start learning 2-18 Realization of bi-directional circular linked list of linear list _2 Main content: menu method implementation of two-way circular linked list& nbsp; [1] push_back [2] push_front [3] show_list [4] pop_back & nbsp; [5] pop_front [6] insert_val [7] find & nbsp; [8] length [31:37] Start learning
Introduction to C Language Programming - Primary Theme Video Course five Bao Songshan Free membership 
SHA MD5 DES RC4 RSA Encryption and Decryption Algorithm Implementation Detailed Video Course five Bao Songshan ￥79.00 
The original book of C Traps and Defects explains the actual combat video course four point eight Bao Songshan ￥49.00 
Video Course of Practical Programming Development Tools four point nine Bao Songshan Free membership
