- Are there established linguistic theories which incorporate the concept of “lazy speech”?
- Get private-keys from wallet using bitcoinj
- can there be a normal wallet that is equivalent to a multisig wallet?
- Electrum multisig 2of2 on separate machines and both offline(cold storage)
- Can someone find out how much bitcoin do I have using my public key?
- Caleb Name Meaning (Hebrew)
- Why did Clement and Eusebius believe that Paul was married?
- Why were none of the Apostolic fathers' writings included in the last canon accepted in the Ecumenical Councils?
- Is it right to talk about dynamic range on frequency domain?
- What algorithms to use for a secure transport protocol on devices with limited computing power
- Multi-secret sharing (Packed secret sharing) - Some questions
- Cryptography scheme to prove you really are the author for something
- Can I get married if my visa has expired?
- What this plant is called
- Which movement was Karl Popper talking about?
- Is this argument valid?
- Does god know what comes after his death?
- What does ダンッ mean?
- I need help with a Japanese Haiku
- Why should a הערמה be allowed and what are the guidelines for its use?
Solidity (Quick or Insertion) Sort
Is it crazy to feel the need to sort solidity arrays?
Imagine implementing a market (double action) you need to sort the orders. I could imagine other usecases where sort is useful. But as we all know even a for loop is dangerous in terms of gas exhaustion. What are best practices in this regard?
The search "Solidity Quicksort" returns nearly no results.
I came up with the idea of letting someone sort and upload the data back to the smart contract, then smart contract can just check if the data is right + sorted, which should be much easier than sorting. O(nlogn) versus O(n). The problem here is that the transaction size grows by O(n) now, which, I feel, could be problematic.
Any guidelines, experiences?