QuantForcesquant interview practice

Home Problemset Contests Profile

…

07008. Find min and max in 3n/2 comparisons

difficulty 1400·answer type: strategy·✓Not solved

Problem

Submit answer

You must be signed in to submit answers.

Problem info

Book: Green Book
Chapter: 7 · Algorithms and Numerical Methods
Section: 7.1 · Algorithms
Pages: 193–194
Difficulty: 1400
Answer type: strategy
Solved by: 0
Attempts: 0

Tags

algorithms comparison optimization

Your submissions

to see your submission history.

Navigation

← All problemsprev · next →

QuantForces · problems from Xinfeng Zhou, A Practical Guide to Quantitative Finance Interviews