0% completed

All LessonsFree Lessons (4)

Introduction

About this course Conventions Source Examples Further Information C++ versus C++11

The Standard Library

History Utilities Components

Overview

Numeric Functions Text Processing Input, Output and Filesystems Multithreading

Application of Libraries

Introduction Including Header Files Using Namespaces Building an Executable

Utilities

Utilities in C++ Standard Library

Useful Functions

The min, max and minmax functions Move vs. Copy Forward Swap

Adaptors for Functions

std::bind and std::function Behavior of std::bind and std::function

Pairs and Tuples

Reference Wrappers

Introduction std::ref and std::cref

Smart Pointers

Introduction Unique Pointers Shared Pointers Weak Pointers Cyclic References

Type Traits

Introduction Check Type Information Type Comparisons and Modifications

Time Library

Introduction Time Point Time Duration Clock

std::any, std::optional, and std::variant

std::any std::optional std::variant

Interface of All Containers

Introduction Create and Delete Size Access Assign and Swap Compare

Sequential Containers

Introduction Arrays Vectors Deques Lists Forward Lists

Associative Containers

Introduction Insertion and Deletion

Ordered Associative Containers

Overview Keys and Values The Comparison Criterion Special Search Functions Maps

Unordered Associative Containers

Overview Keys and Values Performance The Hash Function The Details

Adaptors for Containers

Introduction Stack Queue Priority Queue

Iterators

Introduction Categories Iterator Creation Useful Functions Adaptors

Callable Units

Introduction Functions and Function Objects Lambda Functions

Algorithms

Introduction Conventions Iterators are the glue Sequential, parallel, or parallel execution with vectorisation Algorithms with Parallelized Versions for_each

Non-Modifying Algorithms

Introduction Search Elements Count Elements Check Conditions on Ranges Compare Ranges Search for Ranges within Ranges

Modifying Algorithms

Copy Elements and Ranges Replace Elements and Ranges Remove Elements and Ranges Fill and Create Ranges Move Ranges Swap Ranges Transform Ranges Reverse Ranges Rotate Ranges Randomly Shuffle Ranges Remove Duplicates

More Algorithms

Merge Operations

New Algorithms with C++17

Numeric

Random Numbers Functions Inherited from C

Strings

Create and Delete

Conversion Between C++ and C Strings

Size versus Capacity

Comparison and Concatenation

Input and Output

Modifying Operations

Numeric Conversions

String View

Introduction Create and initialise Non-modifying operations Modifying operations

Regular Expressions

Introduction Character Types Regular Expression Objects The Search Result Match Search Replace Format Repeated Search

Input and Output Streams

Introduction String Streams File Streams State of the Stream User-defined Data Types Hierarchy Iostream Input and Output Functions Format Specifier

File Systems

Filesystem library Classes Non-member functions File types

Multithreading

Memory Model Atomic Data Types Threads Shared Variables Thread Local Data Condition Variables Tasks

C++ Standard Library including C++ 14 & C++ 17/

...

/

Binary Search

Binary Search

The fast search which has a search time of O(log n) has been predefined in C++.

We'll cover the following...

The binary search algorithms use the fact that the ranges are already sorted. To search for an element, use std::binary_search ...