Improve proposal upvoted checking from O(N^2) to O(N)

in witness-category •  last month 

The idea is to use a hash set to reduce the time complexity from O(N^2) to O(N) through the O(1) lookup, instead of linear lookup via indexOf.

Merge a PR: https://github.com/steemit/wallet/pull/249
image.png

Steem to the Moon🚀!

Authors get paid when people like you upvote their post.
If you enjoyed what you read here, create your account today and start earning FREE STEEM!
Sort Order:  
  ·  last month 

!ask hey tell me a joke

Why don't eggs tell jokes? They'd crack each other up!


command: !ask is powered by witness @justyy and his contributions are: https://steemyy.com
More commands are coming!.
!ask is currently based on Grok LLM