- Is there a pool that will tell you the real time shares you've submitted?
- How to get Code from Contract Acccount?
- Vyper bytes type: variable length or effecient alternative?
- Q: Ethereum mempool transaction of Uncle and Fork nodes
- Solidity : About function calls between deployed contracts
- How miners know about forks? (Theoretical question)
- Can ERC20 Token be minted and rewarded automatically based on whatever command?
- What remedies are there for percieved color artifacts due to pixel geometry?
- Does eOS support snap packages from the apps center and is it possible to choose application' update channel in apps center?
- Can a minor negotiate their own contract?
- What methods do lawyers use to find hidden property and assets during divorce
- What kind of agreement should I send as a placeholder?
- В чём отличие лексического повтора и форм слова?
- Тире при присоединительной/пояснительной конструкции
- Двоеточие после “например” в начале предложения
- How does MEAT compare with RICE treatment to treat a tendinopathy (in terms of treatment efficiency)?
- Resources for wooden furniture projects without glue, nails or screws
- How dangerous is particleboard
- What is on the Thelonious Monk “Straight, No Chaser” album cover art?
- A version for this song
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?