https://github.com/traviskaufman/maxgcd

MaxMSP External that uses Euclid's Algorithm to compute the GCD of two numbers
https://github.com/traviskaufman/maxgcd

Last synced: 7 days ago
JSON representation

MaxMSP External that uses Euclid's Algorithm to compute the GCD of two numbers

• Host: GitHub
• URL: https://github.com/traviskaufman/maxgcd
• Owner: traviskaufman
• Created: 2012-02-12T21:59:48.000Z (almost 13 years ago)
• Default Branch: master
• Last Pushed: 2012-02-12T22:01:13.000Z (almost 13 years ago)
• Last Synced: 2025-01-08T15:54:49.829Z (16 days ago)
• Language: C
• Homepage: http://cycling74.com/toolbox/maxgcd/
• Size: 2.49 MB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README

Awesome Lists containing this project

README

        
***************************************************

* MaxGCD                                          *

* Uses a Euclidean Algorithm to compute a GCD     *

* Author: Travis Kaufman                          *

* Version: 1.0.0                                  *

***************************************************

My first MaxxMSP External, this object uses the Euclidean algorithm to determine the 

Greatest Common Divisor between two integers. I really just made it to get my feet 

wet with writing externals, but it may come of use for algorithmic composition so 

I figured I’d post it. Make sure you have a dev environment set up according to Max5's API

before trying to build. Also, this was built using XCode 3, I haven't tested building it

with XCode 4 yet.