PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 64: Offline Range Queries and Query Reordering
← All DSA chapters

Part XI · Chapter 64

Offline Range Queries and Query Reordering
  1. 64.01Offline vs online
  2. 64.02Mo's algorithm
  3. 64.03Mo variations
  4. 64.04Parallel binary search
  5. 64.05CDQ divide and conquer
    1. 3D dominance counting
    2. Offline partial order
    3. Merge-time processing
  6. 64.06Small-to-large technique
  7. 64.07Offline dynamic connectivity
← All DSA chapters

Part XI · Chapter 64

Offline Range Queries and Query Reordering
  1. 64.01Offline vs online
  2. 64.02Mo's algorithm
  3. 64.03Mo variations
  4. 64.04Parallel binary search
  5. 64.05CDQ divide and conquer
    1. 3D dominance counting
    2. Offline partial order
    3. Merge-time processing
  6. 64.06Small-to-large technique
  7. 64.07Offline dynamic connectivity
Home/DSA/Offline Range Queries and Query Reordering/CDQ divide and conquer
64.05Advanced / Expert3 topics

CDQ divide and conquer

Part of Chapter 64: Offline Range Queries and Query Reordering.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

64.05.1

3D dominance counting

Explanation coming soon.

64.05.2

Offline partial order

Explanation coming soon.

64.05.3

Merge-time processing

Explanation coming soon.

← Previous · 64.04

Parallel binary search

Next · 64.06 →

Small-to-large technique

On this page

  • 3D dominance counting
  • Offline partial order
  • Merge-time processing