You are given an integer ‘N’. You have to print integers from 1 to N.
For Example:Input: 'N' = 6
Output: 1 2 3 4 5 6
If 'N' = 6, The numbers from 1 to 6 are 1, 2, 3, 4, 5, 6.
Hence, the output will be 1 2 3 4 5 6.
The first line of the input contains an integer, 'T’, denoting the number of test cases.
The first and only line of each test case will contain a single integer ‘N’.
Output Format :
For each test case, print the integers from 1 to N separated by spaces.
Print a separate line for each test case.
Note :
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 10^4
Time limit: 1 sec
2
6
2
1 2 3 4 5 6
1 2
For the first test case:
N = 6
The numbers from 1 to 6 are 1, 2, 3, 4, 5, 6.
Hence, the output will be 1 2 3 4 5 6.
For the second test case:
N = 2
The numbers from 1 to 2 are 1, 2.
Hence, the output will be 1 2.
2
3
4
1 2 3
1 2 3 4
Run a loop from 1 to N and print each number.
Run a for loop from 1 to N and print each number.
Here is the algorithm:
O(N), where ‘N’ is the given integer.
We have traversed each number from 1 to N exactly once.
Hence, the overall time complexity will be O(N).
O(1)
We are not using any extra space.
Hence the overall space complexity will be O(1).