Gain insights into competitive programming, explore C++ skills with theory, code samples, practice problems, and master faster implementation for contests like ACM ICPC, Google CodeJam, and HackerCup.

Competitive programming can be a great way to build out your programming skills, get on any major company’s radar, and earn a little extra cash along the way.

In this course, you will learn to prepare for competitive programming contests like ACM ICPC, Google CodeJam, Facebook HackerCup, and many more.

Each topic is broken down with a healthy mix of theory, code samples, step-by-step solved sample problems, illustrations, useful practice problems, and tips and tricks for faster implementation.

You will need some solid C++ foundations coming into this course, but by the end it, you will be confident enough in your C++ skills to take home the win.

Competitive Programming in C++: The Keys to Success

# Sorting
Even though you most likely won’t end up writing these sorting algorithms in competitions, it’s a good idea to know that these algorithms exist and how they work.

We will discuss the following sorting algorithms that run in $O(N^2)$ before moving onto algorithms with better performance. 

* Selection Sort
* Bubble Sort
* Insertion Sort

**Tip**: Try putting print statements inside the loops to see how each step of the algorithm affects the array.

---
We’ll start with selection sort in the next lesson.




In this chapter, we'll see some very basic sorting algorithms.


Introduction

Complexity Analysis

Number Theory

Arrays and Vectors

Sieve of Eratosthenes

Strings

Sorting

Linked List

Stack

Queue

Binary Tree

2 Pointers

Heap

Binary Search Tree

Balanced Binary Search Tree

Course Conclusion

Introduction

Sorting