Algorithm

Divisors for any number can be found out by iterating through every number from 1 to that number and checking for the number whether it is a divisor or not. A divisor of any number N is a number that gives remainder as zero on dividing N .

Code

#include <bits/stdc++.h>
using namespace std;

// Class containing the method to find divisors
class Solution {
public:
    // Function to find and print all divisors
    void findDivisors(int n) {
        // Loop from 1 to n
        for (int i = 1; i <= n; i++) {
            // If i divides n completely
            if (n % i == 0) {
                // Print the divisor
                cout << i << " ";
            }
        }
        cout << endl;
    }
};

// Driver code
int main() {
    // Create object of Solution class
    Solution obj;
    // Number whose divisors are to be found
    int n = 12;
    // Call the function
    obj.findDivisors(n);
    return 0;
}
// Class containing the method to find divisors
class Solution {
    // Function to find and print all divisors
    public void findDivisors(int n) {
        // Loop from 1 to n
        for (int i = 1; i <= n; i++) {
            // If i divides n completely
            if (n % i == 0) {
                // Print the divisor
        