Skip to main content

Train Courses Problems Proof Blocks Tools Progress Account

⌄

AccountSign-in, membership, and settings Current courseCalculus IThemeAbout ProofAnvilLoading account…

Problem library

Find a problem

Search by course or topic.

Loading the problem library…

TrainCoursesProblemsProgressMoreTrain Courses Problems Progress

More

Proof Blocks Tools Account

ProofAnvil Practice$19 USD monthly · cancel any time

Pricing FAQ Features Roadmap Use with your agent Support Terms Privacy Refunds

Practice problems with hints and solutions · ProofAnvil

Problem library

Find a problem

Search by course or topic.

Search problems

Filters · 2 active

Area

AllMathPhysics

SubjectCourseTopic

Topic choices for Algorithms are shortened. Search still covers every problem.

StatusSkill

Skills match the applied subject and course.

Problem styleFind a private labelPrivate labelPrivate labels are visible only to you.Private labels ready.Favorites

Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available.

Progress labels

IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due

Problem results

Sort

ProblemsClear skill: Divide Conquer Build a practice set

ProblemCourse & topicStatus

ALG:9920051Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920052Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920053Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920054Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920055Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920056Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920057Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920058An array A[0..n-1] contains records with totally ordered keys and distinct labels.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920059Ordinary selection sort repeatedly finds the first minimum record in the remaining suffix and swaps it with the…

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920060Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920061Give iterative pseudocode for `SIFT-DOWN`, `BUILD-MAX-HEAP`, and heap sort.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920062Design a one-scan, O(1)-word three-way partition of A[l..r] around pivot key v, returning the equal-region boundaries.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920063In the binary comparison model on n distinct keys: 1.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920064Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920065An array of n distinct keys is promised to be a cyclic rotation of a strictly increasing sequence.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920066There are r nonempty sorted runs containing n records total.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920067An array of distinct keys is k-displaced when every key is at most k positions from its sorted position.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920068Records have integer keys in [L,U], possibly negative, and stable nondecreasing output is required.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920069Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920070Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920071Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920072Mathematical problem title

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920073Compare two models: - Model C: n distinct opaque objects, with only binary key comparisons.

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

ALG:9920074Define Lomuto partition for distinct keys by moving a chosen pivot to the end, scanning values smaller than it…

Divide ConquerAlgorithms Problem Solving

Divide-and-conquer algorithmsAlgorithms · Calculation

—

Showing 24 of 50 matching problems.

Private labels

Edit private labels

Add labels that only you can see.

Problem

Current labels

Private labels are unavailable. Close this editor and try again.

New label

Use a short label.

Two disjoint color classes contain

r\ge1

red and

b\ge1

blue planar points.

Given

n\ge2

distinct points in \mathbb

R^3

, find a closest pair.

There are

n\ge2

distinct events represented by points

(t_i,x_i)

; distinct events may share coordinates.

Determine tight bounds for the following recurrences, with

T(n)=\Theta(1)

for

n\le2

and floors or ceilings applied…

Let

T(n)=T(n-1)+T(\lfloor n/2\rfloor)+1\quad(n>1), \qquad T(1)=1

.

An algorithm makes subproblems of sizes

\lceil

n/2\rceil

,

\lfloor

n/4\rfloor

, and

\lfloor

n/8\rfloor

, then…

A recursive procedure costs

\Theta(n^2)

when

n\le

m; otherwise it makes two subproblems of size n/2 and spends…

Bottom-up merge sort starts with width-one runs, stably merges adjacent runs at widths

1,2,4,\ldots

, copies every…

An input of length n has exactly

m_i>0

copies of key i,

1\le

i\le

q, with

\sum_i

m_i=n

.

An array contains bare integers from

\{0,\ldots,K-1\}

.

Each record key lies in

\{0,\ldots,b^d-1\}

and is represented by exactly d base-b digits.

Sort n finite strings lexicographically over a totally ordered alphabet of size s, treating end-of-string

\bot

as…

For independent

X_1,\ldots,X_n\sim\mathrm{Uniform}[0,1)

, bucket sort places

X_i

in B_{\lfloor nX_i\rfloor}…