huff_BinarySearch
Binary search
An implementation of binary search in Solidity for finding elements in sorted arrays.
2 stars
1 watching
0 forks
Language: Solidity
last commit: about 2 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| An implementation of the Quicksort sorting algorithm using a custom data structure called Huff. | 10 |
| A recursive algorithm for finding an element in a sorted array with logarithmic time complexity | 56 |
| A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
| An experimental method for efficiently searching neural network architectures using a single training run. | 489 |
| A utility to read proprietary binary punch format files into xarray-powered workflows | 18 |
| An implementation of a math library using Huff for smart contract arithmetic operations. | 24 |
| A library for performing bitwise operations on data in the Huff language. | 7 |
| A tool to find specific lines or patterns in codebases by searching for matching contexts of contiguous lines. | 381 |
| An interactive tutorial on Binary Search Trees designed for the Swift Playgrounds application on iPads | 24 |
| A simple fuzzy search engine for similar strings in memory-based data | 171 |
| An implementation of popular Solidity libraries and contracts in the Huff language | 18 |
| A tool to quickly inspect and analyze binary executables by parsing and coloring their contents. | 1,714 |
| A Huff implementation of an elliptic curve library used in cryptocurrency applications | 5 |
| A fast and efficient file search library built in Rust | 144 |
| An implementation of an 8-bit array data structure using Huffman coding in Solidity | 12 |