
In this lecture, we provide an introduction to the course.
In this lecture, we will cover the basics of time complexity and the Big O Notation.
In this lecture, we will cover specific applications of time complexity to the USA Computing Olympiad.
In this lecture, we cover an introduction to sorting in C++ and how to use custom boolean comparator functions.
In this lecture, we cover the Codeforces problem "Twins."
In this lecture, we cover an introduction to structures in C++.
In this lecture, we cover how to sort with structures in C++.
In this lecture, we cover the Codeforces problem "Shooting."
In this lecture, we cover the USACO problem "Breed Proximity."
In this lecture, we cover the USACO problem "Painting the Fence."
Prepare for the USA Computing Olympiad (USACO) Silver Competitions and other programming contests! This course is the first part of a series that will give you an overview of the algorithms you need to perform well in contests such as USACO, Codeforces, and more. This course will specifically cover how to sort in Java/C++ and how to solve sorting-related problems.
Topics Covered
STL Sort Function and Comparator
Structures and Sorting
Problem-Solving Practice
Websites/Contest Sites Used
Codeforces
USACO
This course will contain problems from these websites. It is recommended that you make an account (free) on these websites so you can solve the problems we will go over.
Content Overview
Suitable for beginner programmers. It is preferred that you are familiar with the C++ programming language. This course will contain lectures on sorting and video solutions to actual Codeforces/USACO problems.
Prerequisites
Comfortable with programming in C++
Who this course is for
Anyone who is interested in competitive programming
Anyone who is interested in learning more about algorithms and data structures
Anyone who wants to prepare for the USACO Silver competitions