Lectures
Introductory lecture, organizational matters
The first program in C + +, algorithm, program translation, processing, process
Variables, constants, data types
Control of language structure (sequence, branching, cycle)
Structured Programming in C + + functions and their parameters, function calls
Array
Search in array (sequence, interval bisection)
The list, queue, stack
Recursion, definition, examples, a simple backtracking
Sorting, problem definition, address sorting
Basic sorting algorithms(insertion sort, selection, bubble)
Advanced sorting algorithms (quicksort, heapsort, mergesort)
The content of computer training
Getting to know the development environment, Visual Studio 2010 planned
Implementation and debugging trivial programs - Hello World
Implementation and debugging programs with basic structures such as calculating the greatest common divisor
Work with functions, called value parameters, reference, constant parameters
Working with the field
Implementation of algorithms in the search box
Implementation of stack usage examples
Recursive functions
Recursive functions
Sorting Algorithms
Project content
The project specification will be directed to use the sorting and searching algorithms work with fields and the like.
Introductory lecture, organizational matters
The first program in C + +, algorithm, program translation, processing, process
Variables, constants, data types
Control of language structure (sequence, branching, cycle)
Structured Programming in C + + functions and their parameters, function calls
Array
Search in array (sequence, interval bisection)
The list, queue, stack
Recursion, definition, examples, a simple backtracking
Sorting, problem definition, address sorting
Basic sorting algorithms(insertion sort, selection, bubble)
Advanced sorting algorithms (quicksort, heapsort, mergesort)
The content of computer training
Getting to know the development environment, Visual Studio 2010 planned
Implementation and debugging trivial programs - Hello World
Implementation and debugging programs with basic structures such as calculating the greatest common divisor
Work with functions, called value parameters, reference, constant parameters
Working with the field
Implementation of algorithms in the search box
Implementation of stack usage examples
Recursive functions
Recursive functions
Sorting Algorithms
Project content
The project specification will be directed to use the sorting and searching algorithms work with fields and the like.