manrajgrover/algorithms-js

Implement Math Algorithms

Open

#10 opened on May 23, 2017

View on GitHub
 (26 comments) (0 reactions) (0 assignees)JavaScript (132 forks)github user discovery
algorithmsgood first issuehacktoberfest

Repository metrics

Stars
 (200 stars)
PR merge metrics
 (PR metrics pending)

Description

Math algorithms to be implemented are:

  • GCD
  • LCM
  • Multiplication Expo Squaring
  • Find Divisors
  • Fibonacci
  • Fisher Yates
  • Check if number is a prime
  • Calculate square root using Newton's method
  • Extended Euclid Algorithm
  • Mod Inverse
  • Mod Inverse using Fermet
  • Euler's Totient Function
  • Euler's Inverse method
  • Inverse of first 'n' numbers
  • Combination Modular

Contributor guide

Research direction
Implement the unchecked algorithms: Find Divisors, Fibonacci, Fisher Yates, Check Prime, Square Root (Newton), Mod Inverse, Mod Inverse (Fermat), Euler's Totient, Euler's Inverse, Inverse of first n numbers, Combination Modular. Write unit tests for each.
Tech stack
javascript
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
JavaScriptBasic Math
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
80