Introduction to C language with zero basic knowledge
08 minutes13 secondshelloworld
45 minutes28 secondslinux basic commands 1
47 minutes52 secondslinux basic commands 2
36 minutes19 secondslinux basic commands 3
44 minutes35 secondsUse of vim
01 Hours05 minutes22 secondsPractical vim
12 minutes43 secondsReview review.
01 Hours07 minutes42 secondsComputer Languages and Flowcharts
38 minutes44 secondsVariable naming and memory addressing
44 minutes07 secondsComputer Addressing and Complement Codes
57 minutes34 secondsComplementary code
14 minutes11 secondsData types integer and floating point
35 minutes08 secondsCharacter types ascii and escape characters
47 minutes52 secondsreview review
01 Hours00 minutes20 secondsConstants and types
37 minutes21 secondsinput and output
52 minutes26 secondsType conversion.
30 minutes23 secondsOperators and expressions
22 minutes16 secondsOperators and Expressions 2
36 minutes32 secondsLogical relational operations
45 minutes19 secondsConditional comma sizeof summary
32 minutes21 secondsreview review
57 minutes09 secondsmulti-way branch ifelseif
47 minutes07 secondsswitch multi-channel branch
35 minutes58 secondswhile dowhile
40 minutes42 secondsfor
42 minutes05 secondsNesting of loops
32 minutes05 secondsFour major jumps
24 minutes08 secondsReview review getcharputchar
11 minutes04 secondsBack to basics review
40 minutes44 secondsArrays and initialization
42 minutes48 secondsThe nature of array storage subscripts
40 minutes29 secondsFind the maximum value of an array and select sort
37 minutes31 secondshalf search
59 minutes53 secondsIntroduction to two-dimensional arrays
14 minutes28 secondsreview review
47 minutes09 secondsThe essential substitution relationship of two-dimensional arrays
28 minutes50 secondsInitialization of two-dimensional array
28 minutes43 secondsTwo-dimensional array exercise 1
14 minutes07 secondsTwo-dimensional array exercise 2
35 minutes33 secondsArray name ambiguity 1
16 minutes43 secondsArray name ambiguity 2
15 minutes22 secondsCombined training
24 minutes31 secondsBackgammon analysis and design
14 minutes36 secondsPointer opening chapter
31 minutes27 secondsReview Review Arrays
21 minutes14 secondspointer review
28 minutes47 secondsAnalysis of the essence of pointers
32 minutes37 secondsNULL pointer
15 minutes56 secondsPointer arithmetic (assignment and addition)
16 minutes57 secondsPointer arithmetic ends
21 minutes05 secondsArray encounters pointer
29 minutes51 secondsPointer encounters 2D array
20 minutes36 secondsPointer encounters one-dimensional array 2
12 minutes55 secondsPointer encounters two-dimensional array
09 minutes48 secondsReview and in-depth explanation of arrays and pointers
42 minutes54 secondsUse of library functions (rand sin)
46 minutes28 secondsLibrary function usage enumeration
13 minutes17 secondsCustom function
51 minutes43 secondsPass a one-dimensional array
18 minutes09 secondsRecursive deep learning
49 minutes51 secondsReview and review
50 minutes25 secondsGlobal and local variables and scope
33 minutes06 secondsGlobal naming pollution and lifecycle
16 minutes49 secondsmodifier auto register extern
48 minutes22 secondsModifier static
47 minutes58 secondsStringConst
32 minutes42 secondsStrings and character arrays and operations preliminary
01 Hours03 minutes02 secondsScope and modifier review
22 minutes45 secondsString review and improvement
30 minutes02 secondsString native operations to library functions.
32 minutes40 secondsString processing function strcmp
24 minutes19 secondsString processing function strcpy
20 minutes22 secondsString function self-implementation and multi-file encapsulation
33 minutes51 secondsThose zeros you know
14 minutes25 secondsPointer array and bubble sort
43 minutes36 secondsApplication of stack memory and heap memory
58 minutes46 secondsPointer arrays and process space review
45 minutes31 secondsVariable length array vla and memory application model are prone to errors: NULL
55 minutes46 secondsMemory application model prone to errors
29 minutes25 secondsOne life, two, two, three, three, all things
36 minutes25 secondsThree forms of structure type names
33 minutes24 secondsInitialization of structure variables
24 minutes09 secondsStructure assignment structure array
38 minutes50 secondsThe structure is used as a function parameter and returned
19 minutes24 secondsMemory management review and improvement
41 minutes54 secondsStructure review and improvement
38 minutes10 secondstypedef detailed notes
22 minutes45 secondslocaltime function usage
13 minutes37 secondsMemory alignment principles
40 minutes58 secondspointer inside structure
24 minutes03 secondsStack implementation
23 minutes17 secondsunion union
32 minutes58 secondsUse union to find big and small endian order
08 minutes00 secondsenumeration type
20 minutes41 secondsThe beginning of linked list
24 minutes57 secondsStructure review
39 minutes35 secondsShared joint review
13 minutes09 secondsLinked list creation header insertion method
01 Hours03 minutes01 secondsLinked list creation tail insertion method
37 minutes34 secondsThe head insertion method is disassembled into an empty linked list + insertion operation
06 minutes42 secondsFind the length of the linked list
04 minutes36 secondsLinked list search
07 minutes34 secondsLinked list deletion operation
12 minutes10 secondsLinked list exchange value sorting
22 minutes20 secondsLinked list pointer exchange sorting
25 minutes26 secondsReverse of linked list
11 minutes10 secondsReview and improvement of linked lists
57 minutes04 secondsStreaming text files and binary files
38 minutes03 secondsfile buffering
06 minutes34 secondsFile creation and closing
25 minutes02 secondsRead and write one character at a time
47 minutes41 secondsFile encryption (fputcfgetc)
12 minutes33 secondsRead and write characters one line at a time
32 minutes25 secondsRead FAQ one line at a time
40 minutes57 secondsReview + Exercise Processing
51 minutes06 secondsRead and write one block at a time freadfwrite
48 minutes38 secondsRead and write files to linked list
42 minutes03 secondsRead and write files to linked list + interface management
25 minutes33 secondsEncryption of binary data
19 minutes37 secondsrewindftellfseek
12 minutes30 secondsDetailed explanation of bitwise operators
52 minutes53 secondsMasks and applications
39 minutes57 secondsKnowledge Review and Circular Displacement
53 minutes32 secondsCircular shift code implementation
14 minutes04 secondsDetermine whether it is a power number
05 minutes57 secondsNo parameter exchange
25 minutes06 secondsXOR encryption
32 minutes19 secondsCircular shift to implement encrypted binary data
29 minutes13 secondsMacros and conditional compilation
49 minutes41 secondsOther preprocessing
01 Hours24 minutes26 seconds