Program to print all two-digit numbers in descending order

Write a program to print all the two-digit numbers in descending order, that is print all the two-digit numbers from largest to smallest.

Output format:

99 98 97 96 95 94 93 ….. 13 12 11 10

Approach:

We know that the largest two-digit number is 99 and the smallest two-digit number is 10. So, we can start from 99 and then keep on decreasing the number and print till we reach 10.

Step-by-step algorithm:

• Declare a for loop which start from 99 and keep on decreasing the number by 1 till we reach 10.
• For each iteration, print the number.
• After all the iterations, we will have all the two-digit numbers printed in decreasing order.

Below is the implementation of the above approach:

C++

#include <iostream>
using namespace std;

int main() {

    for(int number = 99; number >= 10; number --) {
        cout << number << " ";
    }
    return 0;
}

Java

public class Main {
    public static void main(String[] args) {
        // Iterate from 99 to 10 in reverse order
        for (int number = 99; number >= 10; number--) {
            // Print the current number followed by a space
            System.out.print(number + " ");
        }
    }
}

Python3

# Iterate from 99 down to 10 (inclusive)
for number in range(99, 9, -1):
    # Print the current number followed by a space
    print(number, end=" ")

# Add a newline after printing all numbers
print()

C#

using System;

class Program
{
    static void Main()
    {
        // Loop from 99 to 10 in decreasing order
        for (int number = 99; number >= 10; number--)
        {
            Console.Write(number + " ");
        }

        // Ensure a newline after printing the numbers
        Console.WriteLine();
    }
}

Javascript

for (let number = 99; number >= 10; number--) {
    console.log(number + " ");
}
//this code is contribited by Prachi

Output

99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33...

Time Complexity: O(1)
Auxiliary Space: O(1)