Answer:
I believe the answer is exclusive but im not 100% sure
The answer is : 2001:DB80:1470::200
A double colon ( :: ) can replace any single, contiguous string of one or more 16-bit segments (hextets) which is consist of all 0s, and it can only be used once per IPv6 address. Therefore,any leading 0s (zeros) in any 16-bit section or hextet can be omitted.
Press sign up and put your information in there. Then it should automatically make your profile.
Answer:
Algorithm:
1. Declare an integer variable N.
2. Read the value N from user.
3.While(N):
3.1 find r=N%10;
3.2 print r in new line.
3.3 Update N as N=N/10.
4.end program.
Implementation in C++.
// header
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variable
int N;
cout<<"Enter an Integer:";
cin>>N;
// find the digits of number
while(N)
{
// last digit
int r=N%10;
// print last digit
cout<<r<<endl;
// update the number
N=N/10;
}
return 0;
}
Output:
Enter an Integer:329
9
2
3
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
