With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community
Your Input Matters Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.
If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.
Tags:
Efficient algorithm, finding Max k, incremental
Hi,
I have a hash table of <key,value> pairs. I process input and keep on updating the values associated with the keys. Values always increase ... they are never decremented. I need to keep track of max k values in the hash table.
I need an efficient algorithm - speed is a concern, memory is not ... I am okay with having to maintain an array of k pointers.
I shall be implementing the algorithm in C. Ordering of elements in the top k elements is important ... I need them in ascending order. Value of k is not known in advance.
