< Return
Find the maximum value of an array and select sort
Chapter1 The first day of C language learning
Chapter2 Day 2 of C language learning
Chapter3 Day 3 of C language learning
Chapter4 Day 4 of C language learning
Chapter5 Day 5 of C language learning
Chapter6 Day 6 of C language learning
6-1 review review
6-2 The essential substitution relationship of two-dimensional arrays
6-3 Initialization of two-dimensional array
6-4 Two-dimensional array exercise 1
6-5 Two-dimensional array exercise 2
6-6 Array name ambiguity 1
6-7 Array name ambiguity 2
6-8 Combined training
6-9 Backgammon analysis and design
6-10 Pointer opening chapter
Chapter7 The 7th day of C language learning
7-1 Review Review Arrays
7-2 pointer review
7-3 Analysis of the essence of pointers
7-4 NULL pointer
7-5 Pointer arithmetic (assignment and addition)
7-6 Pointer arithmetic ends
7-7 Array encounters pointer
7-8 Pointer encounters 2D array
7-9 Pointer encounters one-dimensional array 2
7-10 Pointer encounters two-dimensional array
Chapter8 The 8th day of C language learning
Chapter9 Day 9 of C language learning
Chapter10 The 10th day of C language learning
10-1 Scope and modifier review
10-2 String review and improvement
10-3 String native operations to library functions.
10-4 String processing function strcmp
10-5 String processing function strcpy
10-6 String function self-implementation and multi-file encapsulation
10-7 Those zeros you know
10-8 Pointer array and bubble sort
10-9 Application of stack memory and heap memory
Chapter11 The 11th day of C language learning
11-1 Pointer arrays and process space review
11-2 Variable length array vla and memory application model are prone to errors: NULL
11-3 Memory application model prone to errors
11-4 One life, two, two, three, three, all things
11-5 Three forms of structure type names
11-6 Initialization of structure variables
11-7 Structure assignment structure array
11-8 The structure is used as a function parameter and returned
Chapter12 The 12th day of C language learning
12-1 Memory management review and improvement
12-2 Structure review and improvement
12-3 typedef detailed notes
12-4 localtime function usage
12-5 Memory alignment principles
12-6 pointer inside structure
12-7 Stack implementation
12-8 union union
12-9 Use union to find big and small endian order
12-10 enumeration type
12-11 The beginning of linked list
Chapter13 The 13th day of C language learning
13-1 Structure review
13-2 Shared joint review
13-3 Linked list creation header insertion method
13-4 Linked list creation tail insertion method
13-5 The head insertion method is disassembled into an empty linked list + insertion operation
13-6 Find the length of the linked list
13-7 Linked list search
13-8 Linked list deletion operation
13-9 Linked list exchange value sorting
13-10 Linked list pointer exchange sorting
13-11 Reverse of linked list
Chapter14 The 14th day of C language learning
Chapter15 The 15th day of C language learning
15-1 Review + Exercise Processing
15-2 Read and write one block at a time freadfwrite
15-3 Read and write files to linked list
15-4 Read and write files to linked list + interface management
15-5 Encryption of binary data
15-6 rewindftellfseek
15-7 Detailed explanation of bitwise operators
15-8 Masks and applications
Chapter16 The 16th day of C language learning
- Course Recommendations
- Courseware download
There are currently no materials available for download for this course
Students who have watched this course are also learning
Let's briefly talk about starting a business in PHP
Quick introduction to web front-end development
Large-scale practical Tianlongbabu development of Mini version MVC framework imitating the encyclopedia website of embarrassing things
Getting Started with PHP Practical Development: PHP Quick Creation [Small Business Forum]
Login verification and classic message board
Computer network knowledge collection
Quick Start Node.JS Full Version
The front-end course that understands you best: HTML5/CSS3/ES6/NPM/Vue/...[Original]
Write your own PHP MVC framework (40 chapters in depth/big details/must read for newbies to advance)