Skip to content

Instantly share code, notes, and snippets.

@subhodi
Created December 14, 2017 08:31
Show Gist options
  • Star 16 You must be signed in to star a gist
  • Fork 1 You must be signed in to fork a gist
  • Save subhodi/b3b86cc13ad2636420963e692a4d896f to your computer and use it in GitHub Desktop.
Save subhodi/b3b86cc13ad2636420963e692a4d896f to your computer and use it in GitHub Desktop.
Quick sort in Solidity for Ethereum network
pragma solidity ^0.4.18;
contract QuickSort {
function sort(uint[] data) public constant returns(uint[]) {
quickSort(data, int(0), int(data.length - 1));
return data;
}
function quickSort(uint[] memory arr, int left, int right) internal{
int i = left;
int j = right;
if(i==j) return;
uint pivot = arr[uint(left + (right - left) / 2)];
while (i <= j) {
while (arr[uint(i)] < pivot) i++;
while (pivot < arr[uint(j)]) j--;
if (i <= j) {
(arr[uint(i)], arr[uint(j)]) = (arr[uint(j)], arr[uint(i)]);
i++;
j--;
}
}
if (left < j)
quickSort(arr, left, j);
if (i < right)
quickSort(arr, i, right);
}
}
@0nova
Copy link

0nova commented Mar 6, 2024

This takes 350K gas with 100 elements

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment