Timeline for Binary search uneven split number of queries?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2019 at 7:31 | history | edited | John L. | CC BY-SA 4.0 |
Check https://cs.stackexchange.com/revisions/110920/6 for test code.
|
| Jun 20, 2019 at 7:26 | history | edited | John L. | CC BY-SA 4.0 |
Check https://cs.stackexchange.com/revisions/110920/7 for test code.
|
| Jun 20, 2019 at 7:10 | history | edited | John L. | CC BY-SA 4.0 |
Fixed a typo. Clearer explanation. Added code.
|
| Jun 20, 2019 at 4:22 | comment | added | Hema | I actually have a doubt, shouldn't it be n divided by (3/2)^k is approximately equal to 1 in the second para? | |
| Jun 20, 2019 at 4:20 | vote | accept | Hema | ||
| Jun 19, 2019 at 17:11 | history | edited | John L. | CC BY-SA 4.0 |
One more exercise.
|
| Jun 19, 2019 at 17:04 | history | edited | John L. | CC BY-SA 4.0 |
Clearer explanation. Added two exercise.
|
| Jun 19, 2019 at 16:36 | history | edited | John L. | CC BY-SA 4.0 |
Clearer explanation.
|
| Jun 19, 2019 at 16:30 | history | edited | John L. | CC BY-SA 4.0 |
Clearer explanation.
|
| Jun 19, 2019 at 16:25 | history | answered | John L. | CC BY-SA 4.0 |