my-prime
by jinnatul
Finds prime numbers using the Sieve of Eratosthenes algorithm.
AI summary
Prime finder
An algorithm implementation for finding prime numbers
- stars
- 2
- forks
- 0
- watching
- 2
- awesome list
- 1
Similar projects
Found by comparing what the projects do, not just their names.
Prime finder
A basic implementation of a prime number generator in Crystal language
Prime calculator
A Ruby gem providing utility methods for testing and generating primes.
Array finder
Polyfills ES6 Array.prototype.findIndex for older environments
Array finder
Fills ES6 Array.prototype.find method in older environments
Nearest search engine
A Julia package for efficient nearest neighbor searches in high-dimensional spaces
Sudoku solver
A MATLAB program using an heuristic search algorithm to solve specific Sudoku puzzles
Key mapper
Creates an object mapping input values to their string representations as keys.
ML framework
A real-time online machine learning library built on top of Storm and Trident.
Profile scraper
Extracts user data from an npm user's profile page
Root finder
A gem providing methods to compute exact integer roots of real values for arbitrary sized integers.
Package metadata fetcher
A utility for fetching metadata about npm packages based on specific keywords
Optimization algorithm
An implementation of an optimization algorithm inspired by a 2016 research paper
mebeim/aoc403
Puzzle solver
A personal repository of Advent of Code solutions and walkthroughs.
Parser combinator library
A dynamic parser combinator library for Dart.
Number library
A Haskell numeric prelude providing a structured approach to numbers and operations.
Featured in 1 awesome list
Each link jumps to the spot where the list mentions my-prime.
