为每个人编写 C 和 C++ 专业代码
上次更新时间：2024-11-14
课程售价: 2.9 元
联系右侧微信客服充值或购买课程
课程内容
c-for-everyone
- 01_overview (免费)
- 02_history-of-c (免费)
- 01_compiling-debugging-and-running-a-program-part-1
- 02_compiling-debugging-and-running-a-program-part-2-file-included
- 03_first-program
- 04_example-circle-code
- 05_example-marathon
- 01_simple-input-output-fahrenheit
- 02_simple-input-output-miles
- 01_character-sets-and-tokens
- 02_comments
- 03_keywords
- 04_identifiers
- 05_operators
- 06_expressions-and-precedence-file-included
- 07_expression-and-evaluation
- 08_declarations
- 09_fundamental-types-and-sizeof
- 10_the-char-type-file-included
- 11_the-int-type
- 12_the-integer-and-floating-point-types-files-included
- 01_logical-operators-expressions-and-short-circuit-evaluation
- 01_the-conditional-statement-if-and-if-else
- 02_the-iterative-statement-while
- 03_while-cnt-char-explained
- 04_while-code-example
- 01_the-for-statement-and-its-while-analog
- 02_for-statement-code-example
- 03_oddball-operators-conditional-and-comma
- 04_ternary-operator-code-example
- 01_break-and-continue-and-switch-file-included
- 01_function-definition
- 02_function-code-example
- 03_return-statement
- 04_function-prototype
- 05_function-prototype-code-example
- 06_function-variables-with-call-by-value-explained
- 07_function-definitions-and-scope-rules
- 01_storage-class-code-example
- 02_simple-recursion
- 03_recursion-factorial-code
- 04_recursion-fibonacci-code-file-included
- 01_pointers-and-simple-arrays
- 02_initialize-arrays
- 03_array-grade-code-example
- 04_what-is-a-pointer
- 05_pointer-code-example
- 06_call-by-reference-simulated
- 07_array-as-a-parameter
- 08_array-bubble-sort-code
- 09_merge-sort-overview
- 10_merge-code-example-1
- 11_merge-code-example-2-file-included
c-plus-plus-a
- 02_1-1-overview-and-course-organization
- 03_1-2-getting-started
- 04_1-3-converting-a-c-program-to-c
- 05_1-4-using-c-code
- 06_1-5-c-improvements
- 07_1-6-c-advantages
- 08_1-7-c-is-better-than-c
- 09_1-8-c-swap-function
- 10_1-9-swap-function-in-c
- 11_1-10-generics
- 02_2-1-c-generics-and-functions
- 03_2-2-multiple-template-arguments
- 04_2-3-graph-theory-algorithms
- 05_2-4-graph-as-a-data-structure
- 06_2-5-dijkstra-shortest-path
- 07_2-6-c-creating-types
- 08_2-7-enum-operator-overloading
- 09_2-8-example-typedef-days
- 10_2-9-natural-way-to-build-widgets
- 11_2-10-c-point
- 02_3-1-c-classes-object-orientation
- 03_3-2-point-and-its-constructor
- 04_3-3-more-constructors
- 05_3-4-using-dijkstras-algorithm
- 06_3-5-the-is-connected-algorithm
- 07_3-6-complex-aggregates-lists
- 08_3-7-list
- 09_3-8-print-chaining
- 10_3-9-more-elaborate-list
- 11_3-10-deep-vs-shallow-copy
- 12_3-11-destructor
- 13_3-12-dynamic-data-structures-in-stl
- 02_4-1-mst
- 03_4-2-jarnik-prim-mst
- 04_4-3-jarnik-prim-mst-another-look
- 05_4-4-kruskals-algorithm
- 06_4-5-overloading-and-function-selection
- 07_4-6-stl-and-stl-c-11
- 08_4-7-stl-example
- 09_4-8-c-11-feature-auto
- 10_4-9-vector-methods
- 11_4-10-more-code
- 12_4-11-c-11-feature-for-statement
- 13_4-12-stl-input-file
- 14_4-13-iterators-categories
- 15_4-14-output-a-random-graph
c-plus-plus-b
- 01_welcome-to-c-for-c-programmers-part-b
- 01_1-1-overview
- 02_1-2-new-in-c-11
- 03_1-3-standard-template-library
- 01_1-4-iterator-categories
- 02_1-5-example-poker-probability
- 03_1-6-bidirectional-iterator
- 04_1-7-random-access-iterator
- 01_1-8-stl-overview-of-containers
- 02_1-9-associative-containers
- 03_1-10-stl-algorithms-library
- 04_1-11-non-mutating-algorithm
- 01_1-12-lambda-expressions-for-each-function
- 02_1-13-numerical-algorithms
- 03_1-14-functional-objects
- 04_1-15-defined-function-object-classes-function-adapters
- 01_2-1-tic-tac-toe-to-hex
- 02_2-2-homework-basic-hex-program
- 01_2-3-basics-of-inheritance
- 02_2-4-traits-and-inheritance
- 03_2-5-virtual-member-functions
- 04_2-6-c-feature-final
- 05_2-7-topics-on-inheritance
- 01_2-8-hex-overview
- 02_2-9-one-style-for-a-11x11-hex-graph
- 01_2-10-the-inheritance-mechanism
- 02_2-11-a-derived-class-grad-student
- 03_2-12-students-and-graduate-students
- 04_2-13-virtual-function-selection
- 05_2-14-confusion-with-overloading
- 01_3-1-creating-a-c-11-class
- 02_3-2-some-further-constructors
- 03_3-3-move-constructor
- 01_3-4-lookahead
- 02_3-5-plausible-move-generator
- 03_3-6-alpha-beta-algorithm-preview
- 04_3-7-alpha-beta-improvement-to-min-max
- 01_3-8-polish-notation
- 02_3-9-referential-garbage-collection
- 03_3-10-abstract-base-class-0-notation
- 04_3-11-tree-constructors
- 01_4-1-assertion-exception-handling
- 02_4-2-monte-carlo
- 03_4-3-basic-monte-carlo-idea
- 04_4-4-simple-idea-for-generating-board
- 05_4-5-mc-go-2006
- 01_4-6-asserts-and-exceptions
- 02_4-7-static-asserts-new-c-11-feature
- 03_4-8-exceptions
- 01_4-9-c-11-design-patterns
- 02_4-10-c-11-standard
- 03_4-11-thread
- 04_4-12-tuple-c-11-new-library
- 01_4-13-the-bigger-picture
- 02_4-14-factory-method
- 03_4-15-factory-code-c-11-example
- 04_4-16-adapter-pattern
c-structured-programming
- 01_prerequisites-for-this-course
- 02_enums-as-an-adt
- 03_enums-code
- 04_the-c-preprocessor
- 05_preprocessor-code
- 06_use-assert-for-program-correctness
- 07_assert-code
- 01_introduction-to-struc-more-advanced-adts
- 02_how-to-access-struct-members
- 03_introduction-to-the-adt-stack
- 04_using-a-stack-to-reverse-a-string
- 01_intro-to-the-adt-list
- 02_list-of-one-element-code
- 03_full-list-code
- 04_details-of-list-processing
- 05_honors-introduction-to-binary-trees
- 06_honors-detailed-binary-tree-code
- 07_more-advanced-i-o-printf
- 01_introduction-to-file-i-o
- 02_basic-file-i-o-code
- 03_double-spacing-a-file
- 04_use-of-main-argc-argv
- 01_honors-list-code-with-deletion
- 01_intro-to-c
- 02_a-first-example-c-program
- 03_c-features-that-are-easy
- 04_c-program-using-new-features
- 05_c-adt-as-a-class
课程内容
4个章节 , 184个讲座
c-for-everyone
- 01_overview (免费)
- 02_history-of-c (免费)
- 01_compiling-debugging-and-running-a-program-part-1
- 02_compiling-debugging-and-running-a-program-part-2-file-included
- 03_first-program
- 04_example-circle-code
- 05_example-marathon
- 01_simple-input-output-fahrenheit
- 02_simple-input-output-miles
- 01_character-sets-and-tokens
- 02_comments
- 03_keywords
- 04_identifiers
- 05_operators
- 06_expressions-and-precedence-file-included
- 07_expression-and-evaluation
- 08_declarations
- 09_fundamental-types-and-sizeof
- 10_the-char-type-file-included
- 11_the-int-type
- 12_the-integer-and-floating-point-types-files-included
- 01_logical-operators-expressions-and-short-circuit-evaluation
- 01_the-conditional-statement-if-and-if-else
- 02_the-iterative-statement-while
- 03_while-cnt-char-explained
- 04_while-code-example
- 01_the-for-statement-and-its-while-analog
- 02_for-statement-code-example
- 03_oddball-operators-conditional-and-comma
- 04_ternary-operator-code-example
- 01_break-and-continue-and-switch-file-included
- 01_function-definition
- 02_function-code-example
- 03_return-statement
- 04_function-prototype
- 05_function-prototype-code-example
- 06_function-variables-with-call-by-value-explained
- 07_function-definitions-and-scope-rules
- 01_storage-class-code-example
- 02_simple-recursion
- 03_recursion-factorial-code
- 04_recursion-fibonacci-code-file-included
- 01_pointers-and-simple-arrays
- 02_initialize-arrays
- 03_array-grade-code-example
- 04_what-is-a-pointer
- 05_pointer-code-example
- 06_call-by-reference-simulated
- 07_array-as-a-parameter
- 08_array-bubble-sort-code
- 09_merge-sort-overview
- 10_merge-code-example-1
- 11_merge-code-example-2-file-included
c-plus-plus-a
- 02_1-1-overview-and-course-organization
- 03_1-2-getting-started
- 04_1-3-converting-a-c-program-to-c
- 05_1-4-using-c-code
- 06_1-5-c-improvements
- 07_1-6-c-advantages
- 08_1-7-c-is-better-than-c
- 09_1-8-c-swap-function
- 10_1-9-swap-function-in-c
- 11_1-10-generics
- 02_2-1-c-generics-and-functions
- 03_2-2-multiple-template-arguments
- 04_2-3-graph-theory-algorithms
- 05_2-4-graph-as-a-data-structure
- 06_2-5-dijkstra-shortest-path
- 07_2-6-c-creating-types
- 08_2-7-enum-operator-overloading
- 09_2-8-example-typedef-days
- 10_2-9-natural-way-to-build-widgets
- 11_2-10-c-point
- 02_3-1-c-classes-object-orientation
- 03_3-2-point-and-its-constructor
- 04_3-3-more-constructors
- 05_3-4-using-dijkstras-algorithm
- 06_3-5-the-is-connected-algorithm
- 07_3-6-complex-aggregates-lists
- 08_3-7-list
- 09_3-8-print-chaining
- 10_3-9-more-elaborate-list
- 11_3-10-deep-vs-shallow-copy
- 12_3-11-destructor
- 13_3-12-dynamic-data-structures-in-stl
- 02_4-1-mst
- 03_4-2-jarnik-prim-mst
- 04_4-3-jarnik-prim-mst-another-look
- 05_4-4-kruskals-algorithm
- 06_4-5-overloading-and-function-selection
- 07_4-6-stl-and-stl-c-11
- 08_4-7-stl-example
- 09_4-8-c-11-feature-auto
- 10_4-9-vector-methods
- 11_4-10-more-code
- 12_4-11-c-11-feature-for-statement
- 13_4-12-stl-input-file
- 14_4-13-iterators-categories
- 15_4-14-output-a-random-graph
c-plus-plus-b
- 01_welcome-to-c-for-c-programmers-part-b
- 01_1-1-overview
- 02_1-2-new-in-c-11
- 03_1-3-standard-template-library
- 01_1-4-iterator-categories
- 02_1-5-example-poker-probability
- 03_1-6-bidirectional-iterator
- 04_1-7-random-access-iterator
- 01_1-8-stl-overview-of-containers
- 02_1-9-associative-containers
- 03_1-10-stl-algorithms-library
- 04_1-11-non-mutating-algorithm
- 01_1-12-lambda-expressions-for-each-function
- 02_1-13-numerical-algorithms
- 03_1-14-functional-objects
- 04_1-15-defined-function-object-classes-function-adapters
- 01_2-1-tic-tac-toe-to-hex
- 02_2-2-homework-basic-hex-program
- 01_2-3-basics-of-inheritance
- 02_2-4-traits-and-inheritance
- 03_2-5-virtual-member-functions
- 04_2-6-c-feature-final
- 05_2-7-topics-on-inheritance
- 01_2-8-hex-overview
- 02_2-9-one-style-for-a-11x11-hex-graph
- 01_2-10-the-inheritance-mechanism
- 02_2-11-a-derived-class-grad-student
- 03_2-12-students-and-graduate-students
- 04_2-13-virtual-function-selection
- 05_2-14-confusion-with-overloading
- 01_3-1-creating-a-c-11-class
- 02_3-2-some-further-constructors
- 03_3-3-move-constructor
- 01_3-4-lookahead
- 02_3-5-plausible-move-generator
- 03_3-6-alpha-beta-algorithm-preview
- 04_3-7-alpha-beta-improvement-to-min-max
- 01_3-8-polish-notation
- 02_3-9-referential-garbage-collection
- 03_3-10-abstract-base-class-0-notation
- 04_3-11-tree-constructors
- 01_4-1-assertion-exception-handling
- 02_4-2-monte-carlo
- 03_4-3-basic-monte-carlo-idea
- 04_4-4-simple-idea-for-generating-board
- 05_4-5-mc-go-2006
- 01_4-6-asserts-and-exceptions
- 02_4-7-static-asserts-new-c-11-feature
- 03_4-8-exceptions
- 01_4-9-c-11-design-patterns
- 02_4-10-c-11-standard
- 03_4-11-thread
- 04_4-12-tuple-c-11-new-library
- 01_4-13-the-bigger-picture
- 02_4-14-factory-method
- 03_4-15-factory-code-c-11-example
- 04_4-16-adapter-pattern
c-structured-programming
- 01_prerequisites-for-this-course
- 02_enums-as-an-adt
- 03_enums-code
- 04_the-c-preprocessor
- 05_preprocessor-code
- 06_use-assert-for-program-correctness
- 07_assert-code
- 01_introduction-to-struc-more-advanced-adts
- 02_how-to-access-struct-members
- 03_introduction-to-the-adt-stack
- 04_using-a-stack-to-reverse-a-string
- 01_intro-to-the-adt-list
- 02_list-of-one-element-code
- 03_full-list-code
- 04_details-of-list-processing
- 05_honors-introduction-to-binary-trees
- 06_honors-detailed-binary-tree-code
- 07_more-advanced-i-o-printf
- 01_introduction-to-file-i-o
- 02_basic-file-i-o-code
- 03_double-spacing-a-file
- 04_use-of-main-argc-argv
- 01_honors-list-code-with-deletion
- 01_intro-to-c
- 02_a-first-example-c-program
- 03_c-features-that-are-easy
- 04_c-program-using-new-features
- 05_c-adt-as-a-class