24 Reputation Points
Ranked #1K
- Strength to Increase Rep
- +3
- Strength to Decrease Rep
- -0
100% Quality Score
- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
0 Endorsements
Ranked #37.0K
Re: Maybe you found a counterexample. | |
Re: [QUOTE=niek_e;932310]If someone has better idea's to make the posts in the CS-forum more useful, please do reply :)[/QUOTE] We should probably just redirect all the people starting threads in that forum to an English tutor. | |
Re: It's possible and basically straightforward. Note that you can find the median of an ordered indexable set of k elements in O(log k) time and of course you can do insertions and removals in O(log k) time. And each Pi could be such a set. Your English is pretty good. |