spencerdavis2000/GCD
Using Euclid's Algorithm a = bq + r to figure out the Greatest Common Divisor
A Ruby program that uses a simple additive cipher to encrypt and decrypt messages.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
Using Euclid's Algorithm a = bq + r to figure out the Greatest Common Divisor
A beginning and continuous development of a Stock or Commodities Trading platform and simulator.
Server that mimics Excel receiving XLTable data via DDE protocol
Calculating the Standard Deviation in Ruby