XiXi's Competitive Programming L3: CSP-J Advanced Algorithms & Data Structures

Master big integer subtraction with borrow handling

Learn big integer multiplication for extremely long numbers

Implement big integer division

Efficiently sieve primes using the Sieve of Eratosthenes

Decompose integers into products of prime factors

Find the greatest common divisor using the Euclidean algorithm

Understand recurrence and recursion concepts and their applications

Implement depth search problems using recursion

Divide and conquer — break complex problems into smaller subproblems

Learn the divide-and-conquer approach behind merge sort

Master quick sort and its optimization techniques

Quickly find a target element in a sorted sequence

Use binary search on the answer space to find optimal solutions

Accelerate lookup and computation with the doubling technique