Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Your approach seems like it could work, but from the description and the code, you can tell that there is a lot of casework involved. I wouldn't like to be the one having to debug that! So let me give you an alternate solution that should involve less cases, and therefore be much simpler to get right.</p> <p>Keep two multisets (this algorithm also works with two priority queues, as we're only going to look at the extremes of each one). The first, <code>minset</code>, is going to keep the smallest n/2 numbers, and the second, <code>maxset</code>, is going to store the last n/2 numbers.</p> <p>Whenever you add a number:</p> <ul> <li>If it is greater than <code>max(minset)</code>, add it to <code>maxset</code></li> <li>Otherwise, add it to <code>minset</code></li> </ul> <p>Note that this doesn't guarantee the n/2 condition. Therefore, we should add one extra "fixing" step:</p> <ul> <li>If <code>maxset.size() &gt; minset.size()</code>, remove the smallest element from <code>maxset</code> and insert it to <code>minset</code>.</li> <li>If <code>minset.size() &gt; minset.size() + 1</code>, remove the biggest element from <code>minset</code> and insert it to <code>maxset</code>.</li> </ul> <p>After this is done, we just have to get the median. This should be really easy to do with our data structure: depending on whether the current n is even or odd, it's either <code>max(minset)</code> or the average between <code>max(minset)</code> and <code>min(maxset)</code>.</p> <p>For the removal operation, just try to remove it from any of the sets and do the fixing afterwards.</p>
    singulars
    1. This table or related slice is empty.
    1. POinterviewstreet median challenge
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USffao
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COall though the code above is working but it is not passing all test cases. for few it is wrong answer and for 2 it is time limit exceeded. So I am still trying to figure it out..But this is a nice approach.Thanks.
      singulars
      1. PO
      1. USsachin
    2. CO@sachin Your problems are caused by not checking if the iterator you got from the find() is valid before using it in the remove part. I also made some changes to the printing part, see fixed code here: http://pastebin.com/ECJ0Em0J
      singulars
      1. PO
      1. USffao
    3. COThanks ffao..u were right that was the problem..now i will try to implement it using one multiset..:)
      singulars
      1. PO
      1. USsachin
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload