nayana-c1.867c992ae9100904cc61c84591adf0f8f863e0387e30f0d0dbc86640e9f50a1a.en.train.256722
nayana-c1.867c992ae9100904cc61c84591adf0f8f863e0387e30f0d0dbc86640e9f50a1a.en.train.256722: train task in FineEnvs/nayana-ocr-env, an RL environment on the Hugging Face Hub. What is the worst-case complexity for the DELETE operation in a triangulation of n points? A. O(1) B. O(log n) C. O(n) D…
The task
What is the worst-case complexity for the DELETE operation in a triangulation of n points? A. O(1) B. O(log n) C. O(n) D. O(n^2) Return only the single uppercase letter of the correct option.
Task details
- language
- en
- family
- mcq_vqa
- mime
- image/jpeg
- media ready
- False