Time complexity: O(K) + O(N*log(M)) where K is the number of provided keys, N being the number of elements in the sorted set, and M being the number of elements popped
Should not complexity be O(K) + O(M*log(N))?
Comment From: itamarhaber
Hi @pavel-krush - yes, as far as my Big-O notation skillz go, there's something weird here. I guess that it is a copy-paste-partial-refactor of ZPOPMIN/MAX's complexity :)
Would you be interested in making the PR that fixes this? The place do to it is over at https://github.com/redis/redis/blob/unstable/src/commands (moving the issue to that repo as well).
Comment From: enjoy-binbin
oops, i saw i did it wrong in the first place... https://github.com/redis/redis-doc/pull/1654