C++ Programming: What Is A Binary Search?

C++ Programming: What is a BubbleSort?

What you'll learn

What is a C string?

What is character testing?

How can you search and sort arrays?

How to design two dimensional arrays?

Requirements

No programming experience needed.

Description

Welcome to C++ Programming for beginner part 3. This is the third part of the lecture on C++ Programming. You can find the related video on C++ Programming for beginners. This part will cover information such as how pointers are used in the algorithm. In addition, this part will include information about how to search arrays by setting up your code properly. I will discuss how to design the algorithm to do these types of procedures.You can watch the first part of the previous videos if you’re not clear on anything. I did publish C++ Programming for beginner part 1 before creating this part of the lecture material. I think this part is awesome because this part will speak about two-dimensional array. In the other lecture, the focus was mainly on one dimensional array. When we will begin learning about two-dimensional array, we will learn how these arrays can hold multiple sets of data instead of, only holding one set of data.This course is designed for entry level programmers. This course should material which is easy to follow for all. This course does carry a large envelope of material. I will break everything as I go through the lines of code. I personally found the concept of vector puzzling at first. I will try to explain vector as coherent as possible.

Overview

Section 1: Functions

Lecture 1 Default Argument

Lecture 2 The Return Statement

Lecture 3 Call a function

Lecture 4 Call a function (for loop)

Lecture 5 Function Prototype

Lecture 6 Passing data by value

Lecture 7 Returning a boolean value

Lecture 8 Sending data into a function

Lecture 9 Sending data into a function (three parameters)

Lecture 10 Static local variables

Section 2: Array and Vectors

Lecture 11 STL Vectors

Lecture 12 Two-dimensional arrays

Lecture 13 Using parallel arrays

Lecture 14 Range based for loop

Lecture 15 Processing arrays content

Lecture 16 Arrays as function arguments part 2

Lecture 17 Arrays as function arguments part 1

Lecture 18 Accessing array contents

Lecture 19 Accessing array content (for loops)

Section 3: Searching and Sorting Arrays

Lecture 20 Binary search

Lecture 21 Linear Search

Lecture 22 Bubble sort

Section 4: Pointers

Lecture 23 Comparing pointers

Lecture 24 Dynamic Memory Allocation

Lecture 25 Dereferenced

Lecture 26 Indirection operator

Lecture 27 Pointer arithmetic

Lecture 28 Pointer notation

Lecture 29 Pointer Variables

Lecture 30 Pointers as function parameters

Section 5: String Class

Lecture 31 Character Testing

Lecture 32 Character Case Conversion

Lecture 33 String/Numeric Conversion

Lecture 34 Strstr function

Lecture 35 C- String

Beginners.