Posts
 
Reputation
Joined
Last Seen
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
1 Commented Post
0 Endorsements
Ranked #37.0K
~626 People Reached
Favorite Tags
c x 1
Member Avatar for gowth08
Member Avatar for Nick Evan

[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.

Member Avatar for MosaicFuneral
0
301
Member Avatar for XMyKillX
Member Avatar for nissan

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.

Member Avatar for Saschakil
0
73