Click here to Skip to main content
12,829,115 members (43,852 online)
Click here to Skip to main content
Alternatives
Add your own
alternative version

Stats

31.8K views
13 bookmarked
Posted 24 Feb 2011

Fast Integer Algorithms: Greatest Common Divisor and Least Common Multiple, .NET solution

, 19 Apr 2011 CPOL
.NET/C# managed code implementation of 2 core algorithms of integer arithmetic: GCD and LCM (used in "3 Fraction Calculator", best on Google)

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

DrABELL
President Infosoft International Inc
United States United States
Dr. Alexander Bell is a seasoned full-stack Software Engineer (Win/Web/Mobile). He holds PhD in EE/IT, authored 37 inventions and published 300+ technical articles. Currently focused on HTML5/CSS3, Javascript, .NET/WPF/C#, Angular.js, SQL, 'Big Data', Machine Learning, AI, IoT. Alex participated in App Innovation Contests (AIC 2102/2013) with multiple winning submissions. Portfolio samples:

  1. Real-time NY Bus Tracking Web App (IoT)

  2. Integrated Sensors Hub (IMU) Testing Web Page

  3. Semaphon™ semantic phone num-to-text converter

  4. Educational Web Portal

  5. Free Online NY Payroll Tax Calculator

  6. WebTV powered by YouTube Player powered by .NET API (#1 on Google)

  7. Top-50 Digital Cameras (by iMark-DCAM rating engine)

  8. Pure CSS3 Slide Show

  9. Inflation Calculator

  10. Multilingual Geocoder with Interactive Map

  11. Online Semantic Analyzer (Concordance Calculator)

  12. Advanced CSS3 Table Formatting


Pro
Pro
| | Privacy | Terms of Use | Mobile
Web02 | 2.8.170326.1 | Last Updated 19 Apr 2011
Article Copyright 2011 by DrABELL
Everything else Copyright © CodeProject, 1999-2017
Layout: fixed | fluid