Skip to content

This is a beginner-level program for a GCF (Greatest Common Factor) and LCM (Least Common Multiple) Finder using C as the base for its development.

Notifications You must be signed in to change notification settings

Shojiyao12/GCF_LCM-Finder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Project Description

  • The program will display a menu to let the user choose whether to show the GCF (A) or LCM (B). If the options are A and B, the user inputs two non-zero positive numbers and then displays the result. After displaying the required output, the program will display the menu again until the user chooses the exit option (C). (Note: DO/WHILE loop for the menu and FOR loop for all other looping needs).
    • Overview of MP11A:
      • a prototype that uses a basic structure and common algorithm for obtaining GCFs and LCMs.
    • Overview of MP1.1A:
      • the final version (1) that uses a basic structure, but the algorithm has been modified to start the search from the largest number inputted by the user, instead of starting from 0 or 1 every time, for faster execution.
    • Overview of MP2A:
      • the final version (2) that uses functions, but the same algorithm from MP1A.

Quickstart Guide

  1. Copy all the contents from this repository.
  2. Open these files using an IDE, like VSCode
  3. Upon running any of the three files
    • The menu should display the user with three choices:
      • A. GCF
      • B. LCM
      • C. Exit

Core Concept

  • Fundamentals of Programming I

Test Cases

Sample Test Cases for the Program

Preview of the Program for Number Manipulation

Sample of GCF Output Sample of LCM Output

About

This is a beginner-level program for a GCF (Greatest Common Factor) and LCM (Least Common Multiple) Finder using C as the base for its development.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages