Algorithm Search⌘K

Problemcore

Search in a rotated sorted array

Also called cyclically shifted sorted array search.

Find a key in a sorted array rotated at an unknown pivot in O(log n) time when the values are distinct.

Find a key in a sorted array rotated at an unknown pivot in O(log n) time when the values are distinct.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator