Timeline for Algorithm: Binary Search / Tree / Partitioning on unsortable data?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2018 at 22:10 | answer | added | amon | timeline score: 1 | |
| Jul 6, 2018 at 22:03 | comment | added | BobDalgleish |
It is usually called "divide and conquer". I believe your worst case analysis is incorrect: If all n are invalid, it would take n service calls to identify that. With your algorithm, you still have to n service calls at the bottom of the tree, and then n / 2 calls at the next level up, etc, for a total of 2 n service calls.
|
|
| Jul 6, 2018 at 21:46 | history | edited | Martin Ba | CC BY-SA 4.0 |
added 254 characters in body
|
| Jul 6, 2018 at 21:37 | history | asked | Martin Ba | CC BY-SA 4.0 |