Detect the fruit/color name from the uploaded image.
-
Updated
Aug 9, 2020 - Python
Detect the fruit/color name from the uploaded image.
Get the HCF of two numbers by entering them into the command line
Tools, calculators, and converters for Chapter 7: Integer Properties
Euclidean Algorithm to find inverse of x mod n (with steps!)
but what 'bout B-For Math ?
Implementation of the extended "Euclidean" algorithm.
Euclidean Algorithm is an efficient algorithm for finding the greatest common divisor (GCD) of two numbers. It repeatedly computes the remainder of the larger number divided by the smaller number until the remainder is zero, at which point the smaller number is the GCD.
A static website using pure JavaScript for extended euclidean algorithm calculation.
This is a project that can help with boring calculations!
Python Scripts for Haim Lab (Microbiology Research) Projects
Euclidean Division & Euclidean Modulo for Nim
Some of the common algorithms in Swift
Algoritms & data structures implementation library. Plus math problems and solutions of puzzle from CodingBat and Advent of Code. Keywords: Shell sort, Knuth sequence, insertion, quick, merge, selection, queues, stack, list.
encryption and decryption algorithms - 2021.1
PHP fraction library with fraction simplification and float to fraction conversion.
A library of useful funtions used in cryptography. For learning purposes only.
This is a very simple python script that helped me find the Greatest Common Divisor of two numbers using the Euclidean Algorithm (with steps!)
an efficient method for computing the greatest common divisor (GCD) of two integers
Реалізація математичного алгоритму Евкліда для знаходження найбільшого спільного дільника в класичному та модифікованому варіантах
The Euclidean algorithm is a way to find the greatest common divisor of two positive integers. It is a recursive algorithm.
Add a description, image, and links to the euclidean-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the euclidean-algorithm topic, visit your repo's landing page and select "manage topics."