rok commented on pull request #7114:
URL: https://github.com/apache/arrow/pull/7114#issuecomment-625216253


   With guarantee of COO being sorted we could do O(log n). We could already do 
O(log n) for CSR and CSC as they are sorted. CSF has O(ndim) lookup complexity.


----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[email protected]


Reply via email to